Impact Factor (2025): 6.9
DOI Prefix: 10.47001/IRJIET
A motion planner for mobile robots is commonly built out of a number of
different algorithms that solve the two steps of motion planning: representing
the robot and its environment and searching a path through the represented
environment. However, the available literature on motion planning lacks a
generic methodology to arrive at a combination of representations and search
algorithm classes for a practical application. This paper presents a recipe to
select appropriate algorithm classes that solve both steps of motion planning
and to select a suitable approach to combine those algorithm classes. The
recipe is verified by comparing its outcome to the motion planners that has
been successfully applied on robots in practice.
Country : Bosnia and Herzegovina