Results 251 to 260 of about 72,560 (302)

LTA*: Local tangent based A* for optimal path planning

Autonomous Robots, 2021
Optimal path planning on non-convex maps is challenging: sampling-based algorithms (such as RRT) do not provide optimal solution in finite time; approaches based on visibility graphs are computationally expensive, while reduced visibility graphs (e.g., tangent graph) fail on such maps.
Muhammad Mateen Zafar, Muhammad Latif Anjum, Wajahat Hussain   +2 more
openaire   +1 more source

Heuristics for local path planning

IEEE Transactions on Systems, Man, and Cybernetics, 1993
A heuristic technique for solving the problem of path planning based on local information for a mobile robot with acceleration constraints moving amidst a set of stationary obstacles is described. The concept of safety is used to design a planning strategy.
Ashraf Elnagar, Anup Basu
openaire   +1 more source

Neural fields for local path planning

Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190), 2002
In this article we introduce a neural field approach for local path planning of an autonomous mobile robot. The robot's heading direction is determined by the localized peak and its velocity by the maximum activation in the field. We emphasize the neural field's ability to keep the path planning stable even in the case of noisy sensor data or varying ...
Carsten Bruckhoff, Percy Dahm
openaire   +1 more source

Smooth Local Path Planning for Autonomous Vehicles

Proceedings, 1989 International Conference on Robotics and Automation, 1990
Two cost functions of paths for smoothness are defined: path curvature and the derivative of path curvature. Through these definitions, two classes of simple paths are obtained, namely the set of circular arcs and the set of cubic spirals. A cubic spiral is a curve whose tangent direction is described by a cubic function of path distance s.
Yutaka Kanayama, Bruce I. Hartman
openaire   +1 more source

Local-global concurrent path planning and execution

IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2000
Sensor-based discovery (i.e. dynamic) path planning is problematic because the path needs to be continually recomputed as new information is discovered. A process-based client-server approach is presented that permits concurrent sensor-based map and localization-correction updates as well as concurrent path computation and execution.
John S. Zelek, Martin D. Levine
openaire   +1 more source

Model-Based Local Path Planning for UAVs

Journal of Intelligent & Robotic Systems, 2014
Autonomous aviation continuously becomes more and more important. Algorithms that enable this autonomy have developed quickly in the last years. This paper describes a concept for a reactive path planning algorithm. The aim is to develop a method for static obstacle avoidance of an unmanned aerial vehicle (UAV) by calculating collision-free paths ...
Tanja Hebecker, Robert Buchholz, Frank Ortmeier   +2 more
openaire   +1 more source

Path planning for unmanned vehicles with localization constraints

Optimization Letters, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kaarthik Sundar, Sivakumar Rathinam, Rajnikant Sharma   +2 more
openaire   +2 more sources

A local path planning algorithm under the variable planning size

2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI), 2016
The research in the field of the localization and navigation of mobile robot is becoming more and more significant. Among them, the local real-time path planning for robot autonomous navigation in complex environment is particularly important. However, the current local path planning algorithms are all planning the local path in the same plan-scope ...
Teng Wan, Ce Li 0001, Yachao Zhang 0001
openaire   +1 more source