According to the environment modeling approach, path planning algorithms of micro-/nanorobots are classified into searching, sampling, and dynamic aspects. The searching path planning algorithms include the Dijkstra algorithm, the A* algorithm, and the sw (IMAGE)

ELSP

According to the environment modeling approach, path planning algorithms of micro-/nanorobots are classified into searching, sampling, and dynamic aspects. The searching path planning algorithms include the Dijkstra algorithm, the A* algorithm, and the sw

Caption

According to the environment modeling approach, path planning algorithms of micro-/nanorobots are classified into searching, sampling, and dynamic aspects. The searching path planning algorithms include the Dijkstra algorithm, the A* algorithm, and the swarm intelligence algorithm. Sampling path planning algorithms include probabilistic roadmaps and rapidly exploring random trees. Current dynamic path planning algorithms include the dynamic window approach, reinforcement learning, and deep learning.

Credit

Tongzhou Ye/ Anhui University of Science and Technology, Tianhao Peng/ Anhui University of Science and Technology, Lidong Yang/ Hong Kong Polytechnic University.

Usage Restrictions

Credit must be given to the creator.

License

CC BY

Disclaimer: AAAS and EurekAlert! are not responsible for the accuracy of news releases posted to EurekAlert! by contributing institutions or for the use of any information through the EurekAlert system.