Using heuristic distance functions in path planning of mobile robots

摘要

The subject of robotics has always been of great interest to researchers.This holds true now more than ever,with robots found in a growing number of sectors,including domestic use — especially mobile robots.Path planning and localisation in mobile robots are complicated tasks,depending on many parameters,not least finding the optimum path between a starting and destination point,the robot’s power consumption and charging,and its navigation in varied environments without colliding with other objects.