Base placement optimization (BPO) is a fundamental capability for mobile manipulation and has been researched for decades. However, it is still very challenging for some reasons. First, compared with humans, current robots are extremely inflexible, and therefore have higher requirements on the accuracy of base placements (BPs). Second, the BP and task constraints are coupled with each other. The optimal BP depends on the task constraints, and in BP will affect task constraints in turn. More tricky is that some task constraints are flexible and non-deterministic. Third, except for fulfilling tasks, some other performance metrics such as optimal energy consumption and minimal execution time need to be considered, which makes the BPO problem even more complicated. In this paper, a Scale-like disc (SLD) representation of the workspace is used to decouple task constraints and BPs. To evaluate reachability and return optimal working pose over SLDs, a reachability map (RM) is constructed offline. In order to optimize the objectives of coverage, manipulability, and time cost simultaneously, this paper formulates the BPO as a multi-objective optimization problem (MOOP). Among them, the time optimal objective is modeled as a traveling salesman problem (TSP), which is more in line with the actual situation. The evolutionary method is used to solve the MOOP. Besides, to ensure the validity and optimality of the solution, collision detection is performed on the candidate BPs, and solutions from BPO are further fine-tuned according to the specific given task. Finally, the proposed method is used to solve a real-world toilet coverage cleaning task. Experiments show that the optimized BPs can significantly improve the coverage and efficiency of the task.
Near-optimal Sensor Placement for Detecting Stochastic Target Trajectories in Barrier Coverage Systems
Electrical and Computer Engineering, Virginia Polytechnic Institute and State University(电气与计算机工程系,弗吉尼亚理工大学);Johns Hopkins University Applied Physics Laboratory(约翰·霍普金斯大学应用物理实验室)
Task-Space Clustering for Mobile Manipulator Task Sequencing
Singapore Centre for 3D Printing (SC3DP)(新加坡3D打印中心(SC3DP));Nanyang Technological University (NTU)(南洋理工大学(NTU));HP-NTU Digital Manufacturing Corporate Lab(惠普-南洋理工大学数字制造联合实验室);Eureka Robotics(优傲机器人(Eureka Robotics))
On Mobile Ad Hoc Networks for Coverage of Partially Observable Worlds
McGill University Computer Science Department and MILA Institute(麦吉尔大学计算机科学系和MILA研究所);L2S at the University Paris-Saclay, CentraleSupélec(巴黎萨克雷大学L2S及CentraleSupélec)
Min-Sum Uniform Coverage Problem by Autonomous Mobile Robots
Department of Mathematics(数学系);Birla Institute of Technology, Mesra(比拉理工学院,梅斯拉);Advanced Computing and Microelectronics Unit, Indian Statistical Institute(印度统计研究所高级计算与微电子单位)