Bi-objective path planning using deterministic algorithms

Path planning has become a central problem in motion planning. The classic version of the problem aims to find an obstacle-free path with the minimum length for a given workspace containing a set of obstacles and two sources and destination points. However, some real world applications consider maxi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Robotics and autonomous systems Jg. 93; S. 105 - 115
1. Verfasser:	Davoodi, Mansoor
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.07.2017
Schlagworte:	Approximation Bi-objective optimization Clearance Pareto optimal Path planning Bi-objective optimization Path planning Approximation Clearance Pareto optimal
ISSN:	0921-8890, 1872-793X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!