Incorporating Motion Planning Feasibility Considerations during Task-Agent Assignment to Perform Complex Tasks Using Mobile Manipulators

被引:13
|
作者
Kabir, Ariyan M. [1 ]
Thakar, Shantanu [1 ]
Bhatt, Prahar M. [1 ]
Malhan, Rishi K. [1 ]
Rajendran, Pradeep [1 ]
Shah, Brual C. [1 ]
Gupta, Satyandra K. [1 ]
机构
[1] Univ Southern Calif, Los Angeles, CA 90089 USA
基金
美国国家科学基金会;
关键词
D O I
10.1109/icra40945.2020.9196667
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multi-arm mobile manipulators can be represented as a combination of multiple robotic agents from the perspective of task-assignment and motion planning. Depending upon the task, agents might collaborate or work independently. Integrating motion planning with task-agent assignment is a computationally slow process as infeasible assignments can only be detected through expensive motion planning queries. We present three speed-up techniques for addressing this problem(1) spatial constraint checking using conservative surrogates for motion planners, (2) instantiating symbolic conditions for pruning infeasible assignments, and (3) efficiently caching and reusing previously generated motion plans. We show that the developed method is useful for real-world operations that require complex interaction and coordination among high-DOF robotic agents.
引用
收藏
页码:5663 / 5670
页数:8
相关论文
共 3 条
  • [1] Accelerating Motion Planning for Learned Mobile Manipulation Tasks Using Task-Guided Gibbs Sampling
    Bowen, Chris
    Alterovitz, Ron
    ROBOTICS RESEARCH, 2020, 10 : 251 - 267
  • [2] Task and motion planning using mixed integer linear programming for solving fetch-and-carry tasks by a mobile manipulator
    Suwa, Sotaro
    Takeshita, Keisuke
    Yamazaki, Kimitoshi
    ADVANCED ROBOTICS, 2024, 38 (17) : 1188 - 1201
  • [3] An open-source motion planning framework for mobile manipulators using constraint-based task space control with linear MPC
    Stelter, Simon
    Bartels, Georg
    Beetz, Michael
    2022 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2022, : 1671 - 1678