International Conference on Communication Technology Proceedings, 2003. ICCT 2003.
DOI: 10.1109/icct.2003.1209124
|View full text |Cite
|
Sign up to set email alerts
|

A heuristic algorithm for shortest path with multiple constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…The planning algorithm adopted in this paper is the eight-direction multi-objective Dijkstra pathfinding algorithm based on raster map [6]. First to establish a grid map for environment information, so as to establish environmental information.…”
Section: Methodsmentioning
confidence: 99%
“…The planning algorithm adopted in this paper is the eight-direction multi-objective Dijkstra pathfinding algorithm based on raster map [6]. First to establish a grid map for environment information, so as to establish environmental information.…”
Section: Methodsmentioning
confidence: 99%