Robot Navigation Planning Problems in Dynamic Environments
Main robot navigation planning methods and approaches of the dynamic environment are discussed. While considering approaches, performance, the possibility of redundant motions and optimal path existence are taken into account. During path planning the compromise between maximum clearance to obstacles and the shortest path to the destination is discussed. Multi-robot planning is viewed as an offline planning problem with prioritized approach. Planning for unpredictable obstacles and probabilistic routines for known environments including repetitive motions is reviewed. Ill. 4, bibl. 6 (in English; summaries in English, Russian and Lithuanian).
How to Cite
The copyright for the paper in this journal is retained by the author(s) with the first publication right granted to the journal. The authors agree to the Creative Commons Attribution 4.0 (CC BY 4.0) agreement under which the paper in the Journal is licensed.
By virtue of their appearance in this open access journal, papers are free to use with proper attribution in educational and other non-commercial settings with an acknowledgement of the initial publication in the journal.