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

Full description

Bibliographic Details

Published in:	Robotics and autonomous systems Vol. 93; pp. 105 - 115
Main Author:	Davoodi, Mansoor
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2017
Subjects:	Approximation Bi-objective optimization Clearance Pareto optimal Path planning Bi-objective optimization Path planning Approximation Clearance Pareto optimal
ISSN:	0921-8890, 1872-793X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!