Results 11 to 20 of about 72,560 (302)

Local path planning with dynamic obstacle avoidance in unstructured environments [PDF]

open access: yesIECON 2024 - 50th Annual Conference of the IEEE Industrial Electronics Society
Obstacle avoidance and path planning are essential for guiding unmanned ground vehicles (UGVs) through environments that are densely populated with dynamic obstacles.
Ünel, Mustafa   +2 more
core   +4 more sources

Real-time local path planning for mobile robots

open access: yes9th International Workshop on Robot Motion and Control, 2013
International audienceThis paper presents a path planning algorithm for autonomous navigation of nonholonomic mobile robots in complex environment. The irregular contour of obstacles is represented by segments.
Ma, Yingchong   +2 more
core   +4 more sources

Research on Local Obstacle Avoidance Path Planning Algorithm for Autonomous Mining Trucks

open access: yesKongzhi Yu Xinxi Jishu
Autonomous mining trucks currently face several challenges in local obstacle avoidance path planning within mining environments, including difficulties in close-range identification, delays in vehicle-to-ground communication, and the absence of real-time
HUANG Shuai   +4 more
doaj   +2 more sources

Path Planning With Local Motion Estimations [PDF]

open access: yesIEEE Robotics and Automation Letters, 2020
We introduce a novel approach to long-range path planning that relies on a learned model to predict the outcome of local motions using possibly partial knowledge. The model is trained from a dataset of trajectories acquired in a self-supervised way. Sampling-based path planners use this component to evaluate edges to be added to the planning tree.
Jérôme Guzzi   +4 more
openaire   +1 more source

A path planning method using modified harris hawks optimization algorithm for mobile robots [PDF]

open access: yesPeerJ Computer Science, 2023
Path planning is a critical technology that could help mobile robots accomplish their tasks quickly. However, some path planning algorithms tend to fall into local optimum in complex environments.
Cuicui Cai   +4 more
doaj   +2 more sources

iADA*-RL: Anytime Graph-Based Path Planning with Deep Reinforcement Learning for an Autonomous UAV

open access: yesApplied Sciences, 2021
Path planning algorithms are of paramount importance in guidance and collision systems to provide trustworthiness and safety for operations of autonomous unmanned aerial vehicles (UAV).
Aye Aye Maw   +3 more
doaj   +1 more source

A Hybrid Method for Dynamic Local Path Planning [PDF]

open access: yes2009 International Conference on Networks Security, Wireless Communications and Trusted Computing, 2009
A hybrid approach for efficiently planning smooth local paths for mobile robot in an unknown environment is presented. The single robot is treated as a multi-agent system, and the corresponding architecture with cooperative control is constructed.
Li Peng, Huang Xinhang, Wang Min
openaire   +1 more source

Collision-Free 4D Dynamic Path Planning for Multiple UAVs Based on Dynamic Priority RRT* and Artificial Potential Field

open access: yesDrones, 2023
In this paper, a four-dimensional (4D) dynamic cooperative path planning algorithm for multiple unmanned aerial vehicles (UAVs) is proposed, in which the cooperative time variables of UAVs, as well as conflict and threat avoidance, are considered.
Yicong Guo   +3 more
doaj   +1 more source

A Hybrid Path Planning Algorithm for Unmanned Surface Vehicles in Complex Environment With Dynamic Obstacles

open access: yesIEEE Access, 2019
Unmanned surface vesssel (USV) has been widely applied due to its advantages in the military reconnaissance and resources exploration. Path planning is one of the critical issues for USV applications, which usually includes global and local path planning
Zheng Chen   +5 more
doaj   +1 more source

Blended local planning for generating safe and feasible paths [PDF]

open access: yes2008 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2008
Many planning approaches adhere to the two-tiered architecture consisting of a long-range, low fidelity global planner and a short-range high fidelity local planner. While this architecture works well in general, it fails in highly constrained environments where the available paths are limited. These situations amplify mismatches between the global and
Ling Xu, Anthony Stentz
openaire   +1 more source

Home - About - Disclaimer - Privacy