Path planning algorithm under specific constraints in weighted directed graph

@article{Sun2016PathPA,
  title={Path planning algorithm under specific constraints in weighted directed graph},
  author={Qiyun Sun and Wanggen Wan and Guoliang Chen and Xiang Yang Feng},
  journal={2016 International Conference on Audio, Language and Image Processing (ICALIP)},
  year={2016},
  pages={635-640}
}
At present, most of the path planning algorithms are only aimed at reaching the end point from the starting point. However, in practical applications, the existence of a variety of constraints increases the difficulty of path planning , so the Dijkstra algorithm, A* algorithm and other classical algorithms become no longer applicable in such a situation. In this paper, considering the various constraints in practical problems, we abstracted out such kind of path planning problem: In a weighted… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Algorithm for finding shortest path which go through specified intermediate node set[J

  • Huang Shuli, Hu Dasha, Jiang Yuming
  • Computer Engineering and Applications,
  • 2015
1 Excerpt

A Multi-modal Multi-criteria Route Planning Method Based on Genetic Algorithm[J

  • Yu Haicong, Lu Feng
  • Journal of Surveying and mapping,
  • 2014
1 Excerpt

Research on Method of Global Path-planning for Mobile Robot Based on Antcolony Algorithm[J

  • Shi Enxiu, Chen Minmin, Li Jun, Huang Yumei
  • Transactions of the Chinese Society for…
  • 2014
1 Excerpt

Similar Papers

Loading similar papers…