![Scientific and technical journal «Priborostroenie»](/images/mag-pr.png)
Journal
Scientific and technical journal «Priborostroenie»
UDK004.021
Issue:3 (65)
Download PDF700 Kbyte
An algorithm for planning the movement of a multi-link robotic system in an environment with obstacles is considered. The main requirements for this task are high performance and efficient memory usage during operation. An algorithm for path planning based on the method of a bidirectional fast-investigating random tree is presented. An approach is used which excludes addition of new vertices to the tree if their location in space can unambiguously conclude that it is inappropriate to use them in the path construction. This modification makes it possible to speed up movement planning and reduce the amount of memory needed to store the environment analysis data.