Study on Dijkstra Path Planning of Sensor Networks Based on Optimized Ant Colony Algorithm

DOI

10.2991/mcei-18.2018.70How to use a DOI?

Keywords

Ant colony algorithm; Wireless sensor network; Robot; Path planning; Dijkstra

Abstract

With the continuous development of various sensor network positioning technologies, the accuracy of robot path planning based on wireless sensor networks has been continuously improved. Therefore, a Dijkstra path planning method for sensor networks based on optimized ant colony algorithm is proposed. Firstly, the CC2430 sensor network communication node module is designed based on the IEEE802.15.4 standard, and the CC2430 packet header format is modified to realize remote communication between nodes. Finally, the ant colony optimization is used to improve the dijkstra shortest path algorithm. The experimental results show that compared with the traditional algorithm, the proposed algorithm has a lower path planning length, can effectively complete the path planning optimization, and can meet the requirements of a variety of path navigation.

Copyright

© 2018, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jing Sun
PY  - 2018/06
DA  - 2018/06
TI  - Study on Dijkstra Path Planning of Sensor Networks Based on Optimized Ant Colony Algorithm
BT  - Proceedings of the 2018 8th International Conference on Mechatronics, Computer and Education Informationization (MCEI 2018)
PB  - Atlantis Press
SP  - 345
EP  - 350
SN  - 2352-538X
UR  - https://doi.org/10.2991/mcei-18.2018.70
DO  - 10.2991/mcei-18.2018.70
ID  - Sun2018/06
ER  -