Multi-objective path planning for unrestricted mobile

Problem of multi-objective path planning is investigated in this paper for the ball and plate system. The purpose of multi-objective path planning is to obtain the safe and shortest path for the ball to track. Workspace is represented by distance map and hazard map. Weights for multi-objectives are...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE International Conference on Automation and Logistics pp. 1046 - 1051
Main Authors Feng Guo, Hongrui Wang, Yantao Tian
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2009
Subjects
Online AccessGet full text
ISBN9781424447947
1424447941
ISSN2161-8151
DOI10.1109/ICAL.2009.5262574

Cover

Loading…
More Information
Summary:Problem of multi-objective path planning is investigated in this paper for the ball and plate system. The purpose of multi-objective path planning is to obtain the safe and shortest path for the ball to track. Workspace is represented by distance map and hazard map. Weights for multi-objectives are calculated by entropy method for each grid node. Dijkstra algorithm is employed to solve the multi-objective path planning problem finally. As illustrated by simulation results, the path obtained by multi-objective method proposed in this paper is much safer compared with single-objective A* algorithm.
ISBN:9781424447947
1424447941
ISSN:2161-8151
DOI:10.1109/ICAL.2009.5262574