Coverage path planning optimization based on Q-learning algorithm-Reference-Cited by-同舟云学术

Coverage path planning optimization based on Q-learning algorithm

Published:2019 Issue: Volume: Page:
ISSN:0094-243X
Container-title:AIP Conference Proceedings
language:
Short-container-title:

Author:

Piardi Luis,Lima José,Pereira Ana I.,Costa Paulo

Publisher

AIP Publishing

Link

http://aip.scitation.org/doi/pdf/10.1063/1.5114220

Reference11 articles.

1. Approximation algorithms for lawn mowing and milling☆☆A preliminary version of this paper was entitled “The lawnmower problem” and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466.

2. Busoniu, L., Babuska, R., De Schutter, B., and Ernst, D. (2010). Reinforcement learning and dynamic programming using function approximators. CRC press.

3. Dogru, S. and Marques, L. (2017). A*-based solution to the coverage path planning problem. In Iberian Robotics conference, pages 240–248. Springer.

4. Gajjar, S., Bhadani, J., Dutta, P., and Rastogi, N. (2017). Complete coverage path planning algorithm for known 2d environment. In Recent Trends in Electronics, Information & Communication Technology (RTEICT), 2017 2nd IEEE International Conference on, pages 963–967. IEEE.

5. A survey on coverage path planning for robotics

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Competitive Ant Coverage: The Value of Pursuit;2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS);2023-10-01

2. Path Planning in Dynamic Environments Based on Q-Learning;Highlights in Science, Engineering and Technology;2023-08-08

3. MazeCov-Q: An Efficient Maze-Based Reinforcement Learning Accelerator for Coverage;2023 IEEE Symposium in Low-Power and High-Speed Chips (COOL CHIPS);2023-04-19

4. Predator-Prey Reward Based Q-Learning Coverage Path Planning for Mobile Robot;IEEE Access;2023