A Two-Stage Method for Target Searching in the Path Planning for Mobile Robots

被引:9
|
作者
Song, Tao [1 ]
Huo, Xiang [1 ]
Wu, Xinkai [1 ,2 ]
机构
[1] Beihang Univ, Sch Transportat Sci & Engn, Beijing 100193, Peoples R China
[2] Beihang Univ, Beijing Adv Innovat Ctr Big Data & Brain Comp, Beijing 100193, Peoples R China
关键词
targets search; mobile robot; path planning; visual complete coverage; two-stage;
D O I
10.3390/s20236919
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
The path planning for target searching in mobile robots is critical for many applications, such as warehouse inspection and caring and surveillance for elderly people in the family scene. To ensure visual complete coverage from the camera equipped in robots is one of the most challenging tasks. To tackle this issue, we propose a two-stage optimization model to efficiently obtain an approximate optimal solution. In this model, we first develop a method to determine the key locations for visual complete coverage of a two-dimensional grid map, which is constructed by drawing lessons from the method of corner detection in the image processing. Then, we design a planning problem for searching the shortest path that passes all key locations considering the frequency of target occurrence. The testing results show that the proposed algorithm can achieve the significantly shorter search path length and the shorter target search time than the current Rule-based Algorithm and Genetic Algorithm (GA) in various simulation cases. Furthermore, the results show that the improved optimization algorithm with the priori known frequency of occurrence of the target can further improve the searching with shorter searching time. We also set up a test in a real environment to verify the feasibility of our algorithm.
引用
收藏
页码:1 / 18
页数:18
相关论文
共 50 条
  • [1] A Global-Local Coupling Two-Stage Path Planning Method for Mobile Robots
    Jian, Zhiqiang
    Zhang, Songyi
    Chen, Shitao
    Nan, Zhixiong
    Zheng, Nanning
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2021, 6 (03) : 5349 - 5356
  • [2] A Boundary Node Method for path planning of mobile robots
    Saeed, R. A.
    Recupero, Diego Reforgiato
    Remagnino, Paolo
    ROBOTICS AND AUTONOMOUS SYSTEMS, 2020, 123
  • [3] Path planning method for mobile robots in changing environments
    Blanco, FJ
    Moreno, V
    Curto, B
    INTELLIGENT COMPONENTS FOR VEHICLES, 1998, : 371 - 376
  • [4] Hierarchical path planning method for autonomous mobile robots
    Kurihara, K
    Hasegawa, J
    Nishiuchi, N
    ADVANCES IN INTELLIGENT SYSTEMS AND ROBOTICS, 2003, 101 : 1 - 8
  • [5] Two Stage Path Planning Method for Co-Worked Double Industrial Robots
    Zhang, Li-Xiang
    Meng, Xin-Jia
    Ding, Zhi-Jie
    Wang, Tian-Shu
    IEEE ACCESS, 2023, 11 : 126995 - 127010
  • [6] Mobile robots path planning method with the existence of moving obstacles
    Kurihara, Kenzo
    Nishiuchi, Nobuyuki
    Hasegawa, Jun
    Masuda, Kazuaki
    ETFA 2005: 10th IEEE International Conference on Emerging Technologies and Factory Automation, Vol 1, Pts 1 and 2, Proceedings, 2005, : 195 - 202
  • [7] Target Searching of Mobile Robots Using Improved A* Searching Algorithm
    Chang, C. H.
    Zou, J. T.
    Su, K. L.
    MECHATRONICS AND APPLIED MECHANICS II, PTS 1 AND 2, 2013, 300-301 : 519 - +
  • [8] Effective Mobile Target Searching Using Robots
    Wong, Wai Kit
    Ye, Shujin
    Liu, Hai
    Wang, Yue
    MOBILE NETWORKS & APPLICATIONS, 2022, 27 (01): : 249 - 265
  • [9] Effective Mobile Target Searching Using Robots
    Wai Kit Wong
    Shujin Ye
    Hai Liu
    Yue Wang
    Mobile Networks and Applications, 2022, 27 : 249 - 265
  • [10] Effective Mobile Target Searching Using Robots
    Wong, Wai Kit
    Ye, Shujin
    Liu, Hai
    Wang, Yue
    Mobile Networks and Applications, 2022, 27 (01) : 249 - 265