Collision-free and crossing-free trajectory design for second-order agents persistent monitoring

被引:1
|
作者
Zhao, Ming-Jie [1 ,2 ]
Yang, Wu [1 ,2 ,4 ]
Wang, Yan-Wu [1 ,2 ,3 ]
Xiao, Jiang-Wen [1 ,2 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Artificial Intelligence & Automat, Wuhan 430074, Peoples R China
[2] Huazhong Univ Sci & Technol, Natl Key Lab Sci & Technol Multispectral Informat, Wuhan, Peoples R China
[3] China Three Gorges Univ, Hubei Prov Collaborat Innovat Ctr New Energy Micr, Yichang, Hubei, Peoples R China
[4] Huazhong Univ Sci & Technol, Sch Elect & Elect Engn, Wuhan 430074, Hubei, Peoples R China
基金
中国国家自然科学基金;
关键词
SENSOR NETWORKS; COVERAGE; TRACKING; TARGET;
D O I
10.1016/j.jfranklin.2020.04.046
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we utilize second-order agents to address a one-dimensional persistent monitoring problem with potential agent collision and boundary-crossing problems. The objective is to minimize a sum of accumulated performance metric associated with targets over a finite time horizon by controlling the movements of agents. Different from the existing work where a collision avoidance algorithm is designed for avoiding collisions and boundary crossings, we consider these problems at the beginning of the problem formulation and further utilize Exterior Point Method (EPM) to propose a novel combinatorial objective function which guarantees a collision-free and crossing-free solution by penalizing all possible agents collisions and boundary crossings. According to Pontryagin Minimum Principle (PMP), we show that the optimal agent trajectories can be fully described by some parameters. Based on Infinitesimal Perturbation Analysis (IPA), a standard gradient descent method is proposed to obtain the optimal parameters. Our collision-free and crossing-free approach is computationally efficient as compared to the existing algorithm. Numerical examples are included to demonstrate the effectiveness of the proposed methods. (C) 2020 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:8726 / 8743
页数:18
相关论文
共 50 条
  • [41] Collision-Free Cartesian Trajectory Generation Using Raster Scanning and Genetic Algorithms
    Andreas C. Nearchou
    Nikos A. Aspragathos
    Journal of Intelligent and Robotic Systems, 1998, 23 : 351 - 377
  • [42] An online collision-free trajectory generation algorithm for human-robot collaboration
    Wang, Yanzhe
    Wei, Lai
    Du, Kunpeng
    Liu, Gongping
    Yang, Qian
    Wei, Yanding
    Fang, Qiang
    ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2023, 80
  • [43] COLLISION-FREE TRAJECTORY CONTROL FOR MULTIPLE ROBOTS BASED ON NEURAL OPTIMIZATION NETWORK
    LEE, JH
    BIEN, ZG
    ROBOTICA, 1990, 8 : 185 - 194
  • [44] Automatic Collision-Free Trajectory Generation for Collaborative Robotic Car-Painting
    Zbiss, K.
    Kacem, A.
    Santillo, Mario
    Mohammadi, A.
    IEEE ACCESS, 2022, 10 : 9950 - 9959
  • [45] Concurrent Goal Assignment and Collision-Free Trajectory Generation for Multiple Aerial Robots
    Gravell, Benjamin
    Summers, Tyler
    IFAC PAPERSONLINE, 2018, 51 (12): : 75 - 81
  • [46] Collision-Free Trajectory Generation of Robotic Manipulators Using Receding Horizon Strategy
    Chung, Hoam
    Jeon, Soo
    2011 AMERICAN CONTROL CONFERENCE, 2011,
  • [47] Path-Constrained and Collision-Free Optimal Trajectory Planning for Robot Manipulators
    Wen, Yalun
    Pagilla, Prabhakar
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2023, 20 (02) : 763 - 774
  • [48] Collision-Free Trajectory Planning With Deadlock Prevention: An Adaptive Virtual Target Approach
    Mohan, Rishi
    Silvas, Emilia
    Stoutjesdijk, Henry
    Bruyninckx, Herman
    De Jager, Bram
    IEEE ACCESS, 2020, 8 (08): : 115240 - 115250
  • [49] Collision-free Cartesian trajectory generation using raster scanning and genetic algorithms
    Nearchou, AC
    Aspragathos, NA
    JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, 1998, 23 (2-4) : 351 - 377
  • [50] Collision-free optimal trajectory generation for a space robot using genetic algorithm
    Seddaoui, Asma
    Saaj, Chakravarthini M.
    ACTA ASTRONAUTICA, 2021, 179 (179) : 311 - 321