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...

Celý popis

Podrobná bibliografia

Vydané v:	Robotics and autonomous systems Ročník 93; s. 105 - 115
Hlavný autor:	Davoodi, Mansoor
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.07.2017
Predmet:	Approximation Bi-objective optimization Clearance Pareto optimal Path planning Bi-objective optimization Path planning Approximation Clearance Pareto optimal
ISSN:	0921-8890, 1872-793X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!