{"title":"动态环境下基于云的机器人路径规划","authors":"Xinquan Chen, Lujia Wang, Xitong Gao, Cheng-Zhong Xu","doi":"10.1109/RCAR52367.2021.9517435","DOIUrl":null,"url":null,"abstract":"Most of the current path planning applications only focus on a single agent, without considering the surrounding robots or dynamic obstacles. In safety-critical environments, such as the crowded playground, the robot may have increased difficulty reaching the destination with crowds moving around, sometimes even cause damages. With the development of cloud computing and swarm intelligence, the concept of “cloud robotic” has been followed by more scholars. With collaboration and information sharing between robots, the cluster has better problem-solving skills than the individual. In this paper, we propose a cloud-based multi-agent navigation algorithm in dynamic environments. We propose the concept of pheromones of dynamic obstacles that represent congestion to enable clusters to plan collaboratively. Widespread static sensors are introduced to jointly estimate congestion in the environment with robots. When an agent needs route planning, the cloud provides safe and fast route with intermediate points. The robot uses a simple yet effective local planner based on artificial potential field (APF) to trace the trajectory. We demonstrate this approach's effectiveness compared to traditional A* global planner and APF local planner with traditional repulsion function. Experiments show that our cloud-based method reduces the number of collisions by 92.6%, with only 35% increase in path length. All code for reproducing the experiments is at https://github.com/Asber777/CDPP.","PeriodicalId":232892,"journal":{"name":"2021 IEEE International Conference on Real-time Computing and Robotics (RCAR)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Cloud-based Robot Path Planning in Dynamic Environments\",\"authors\":\"Xinquan Chen, Lujia Wang, Xitong Gao, Cheng-Zhong Xu\",\"doi\":\"10.1109/RCAR52367.2021.9517435\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most of the current path planning applications only focus on a single agent, without considering the surrounding robots or dynamic obstacles. In safety-critical environments, such as the crowded playground, the robot may have increased difficulty reaching the destination with crowds moving around, sometimes even cause damages. With the development of cloud computing and swarm intelligence, the concept of “cloud robotic” has been followed by more scholars. With collaboration and information sharing between robots, the cluster has better problem-solving skills than the individual. In this paper, we propose a cloud-based multi-agent navigation algorithm in dynamic environments. We propose the concept of pheromones of dynamic obstacles that represent congestion to enable clusters to plan collaboratively. Widespread static sensors are introduced to jointly estimate congestion in the environment with robots. When an agent needs route planning, the cloud provides safe and fast route with intermediate points. The robot uses a simple yet effective local planner based on artificial potential field (APF) to trace the trajectory. We demonstrate this approach's effectiveness compared to traditional A* global planner and APF local planner with traditional repulsion function. Experiments show that our cloud-based method reduces the number of collisions by 92.6%, with only 35% increase in path length. All code for reproducing the experiments is at https://github.com/Asber777/CDPP.\",\"PeriodicalId\":232892,\"journal\":{\"name\":\"2021 IEEE International Conference on Real-time Computing and Robotics (RCAR)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Conference on Real-time Computing and Robotics (RCAR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RCAR52367.2021.9517435\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Real-time Computing and Robotics (RCAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RCAR52367.2021.9517435","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cloud-based Robot Path Planning in Dynamic Environments
Most of the current path planning applications only focus on a single agent, without considering the surrounding robots or dynamic obstacles. In safety-critical environments, such as the crowded playground, the robot may have increased difficulty reaching the destination with crowds moving around, sometimes even cause damages. With the development of cloud computing and swarm intelligence, the concept of “cloud robotic” has been followed by more scholars. With collaboration and information sharing between robots, the cluster has better problem-solving skills than the individual. In this paper, we propose a cloud-based multi-agent navigation algorithm in dynamic environments. We propose the concept of pheromones of dynamic obstacles that represent congestion to enable clusters to plan collaboratively. Widespread static sensors are introduced to jointly estimate congestion in the environment with robots. When an agent needs route planning, the cloud provides safe and fast route with intermediate points. The robot uses a simple yet effective local planner based on artificial potential field (APF) to trace the trajectory. We demonstrate this approach's effectiveness compared to traditional A* global planner and APF local planner with traditional repulsion function. Experiments show that our cloud-based method reduces the number of collisions by 92.6%, with only 35% increase in path length. All code for reproducing the experiments is at https://github.com/Asber777/CDPP.