2014 18th International Conference on System Theory, Control and Computing (ICSTCC) 2014
DOI: 10.1109/icstcc.2014.6982439
|View full text |Cite
|
Sign up to set email alerts
|

Pareto genetic path planning hybridized with multi-objective Dijkstra's algorithm

Abstract: This paper presents an evolutionary approach to multi-objective path planning. The paths are defined on continuous scenes with disjoint and/or non-convex obstacles, for robots moving towards their destinations along linearly piecewise trajectories with any number of vertices. The fastest feasible route is genetically selected via a simultaneous minimization of path length and path steering angle. In order to assure an effective partial sorting of the potential solutions, the genetic algorithm makes use of a se… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 14 publications
(22 reference statements)
0
2
0
Order By: Relevance
“…Although the FPAA hardware uses the weights expressed as conductances, (11), the MATLAB simulation uses these conductances converted into resistances,…”
Section: B Software Simulationsmentioning
confidence: 99%
See 1 more Smart Citation
“…Although the FPAA hardware uses the weights expressed as conductances, (11), the MATLAB simulation uses these conductances converted into resistances,…”
Section: B Software Simulationsmentioning
confidence: 99%
“…Previous Multi-Objective path planning has been accomplished using techniques such as genetic algorithms [10], Pareto fronts [11], A* [12], Multi-Step A* [13], Multi-Objective D* lite [14], Rapidly Exploring Random Tree (RRT) based algorithms [15], [16], Neuromorphic systems [17], and Dijkstra's algorithm [11], [18].…”
Section: Introductionmentioning
confidence: 99%