Introduction to Algorithms
Planning Algorithms
Motion planning using adaptive random walks
IEEE Transactions on Robotics
Mobility Model for Tactical Networks
HoloMAS '09 Proceedings of the 4th International Conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing
Autonomous UAV Surveillance in Complex Urban Environments
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
HoloMAS'11 Proceedings of the 5th international conference on Industrial applications of holonic and multi-agent systems for manufacturing
| Hi-index | 0.00 |
The paper addresses the area of path planning for non-holonomic vehicles operating in a large-scale dynamic continuous three-dimensional space where the vehicle has to avoid given obstacles and restricted areas. For vehicles, motion dynamics is defined by means of constraints on the driving manoeuvres and restrictions on smoothness of the trajectory. The paper addresses only the basic spatial path planning problem -- a process searching for a spatial arrangement of the trajectory from the given start position and orientation to the given target position and orientation. Extended problems like incremental planning are not considered by this paper. The dynamic environment means that obstacles' and restricted areas' definitions are altered almost after each particular search.