Path planning for robotic coverage is the task of determining a collision-free robot trajectory that observes all points of interest in an environment. Robots employed for such tasks are often capable of exercising active control over onboard observational sensors during navigation. In this paper, we tackle the problem of planning robot and sensor trajectories that maximize information gain in such tasks where the robot needs to cover points of interest with its sensor footprint. Search-based planners in general guarantee completeness and provable bounds on suboptimality with respect to an underlying graph discretization. However, searching for kinodynamically feasible paths in the joint space of robot and sensor state variables with standard search is computationally expensive. We propose two alternative search-based approaches to this problem. The first solves for robot and sensor trajectories independently in decoupled state spaces while maintaining a history of sensor headings during the search. The second is a two-step approach that first quickly computes a solution in decoupled state spaces and then refines it by searching its local neighborhood in the joint space for a better solution. We evaluate our approaches in simulation with a kinodynamically constrained unmanned aerial vehicle performing coverage over a 2D environment and show their benefits.
IIIT-Delhi（德里印度理工学院）；CNLS, Los Alamos National Laboratory（洛斯阿拉莫斯国家实验室非线性研究中心）；Texas A&M University（得克萨斯农工大学）；Loughbrough University（拉夫堡大学）
Low cost Unmanned Aerial Vehicles (UAVs) need multiple refuels to accomplish large area coverage. The number of refueling stations and their placement plays a vital role in determining coverage efficiency. In this paper, we propose the use of a ground-based refueling vehicle (RV) to increase the operational range of a UAV in both spatial and temporal domains. Determining optimal routes for the UAV and RV, and selecting optimized locations for refueling to aid in minimizing coverage time is a challenging problem due to different vehicle speeds, coupling between refueling location placement, and…
Technische Universität München（慕尼黑工业大学）；Tsinghua University（清华大学）；Avic Shenyang Aircraft Design And Research Institute（中国航空工业集团沈阳飞机设计研究所）
For scenes such as floods and earthquakes, the disaster area is large, and rescue time is tight. Multi-UAV exploration is more efficient than a single UAV. Existing UAV exploration work is modeled as a Coverage Path Planning (CPP) task to achieve full coverage of the area in the presence of obstacles. However, the endurance capability of UAV is limited, and the rescue time is urgent. Thus, even using multiple UAVs cannot achieve complete disaster area coverage in time. Therefore, in this paper we propose a multi-Agent Endurance-limited CPP (MAEl-CPP) problem based on a priori heatmap of the di…
Carnegie Mellon University（卡内基梅隆大学）；Mitsubishi Heavy Industries, Ltd.（三菱重工业株式会社）
Planning for multi-robot coverage seeks to determine collision-free paths for a fleet of robots, enabling them to collectively observe points of interest in an environment. Persistent coverage is a variant of traditional coverage where coverage-levels in the environment decay over time. Thus, robots have to continuously revisit parts of the environment to maintain a desired coverage-level. Facilitating this in the real world demands we tackle numerous subproblems. While there exist standard solutions to these subproblems, there is no complete framework that addresses all of their individual ch…
Democritus University of Thrace（色雷斯德谟克利特大学）；Information Technologies Institute, The Centre for Research & Technology, Hellas（希腊研究与技术中心信息技术研究所）；National Technical University（国立技术大学）
This paper proposes a novel mission planning platform, capable of efficiently deploying a team of UAVs to cover complex-shaped areas, in various remote sensing applications. Under the hood lies a novel optimization scheme for grid-based methods, utilizing Simulated Annealing algorithm, that significantly increases the achieved percentage of coverage and improves the qualitative features of the generated paths. Extensive simulated evaluation in comparison with a state-of-the-art alternative methodology, for coverage path planning (CPP) operations, establishes the performance gains in terms of a…
Utilization of Unmanned Aerial Vehicles (UAVs) in military and civil operations is getting popular. One of the challenges in effectively tasking these expensive vehicles is planning the flight routes to monitor the targets. In this work, we aim to develop an algorithm which produces routing plans for a limited number of UAVs to cover maximum number of targets considering their flight range. The proposed solution for this practical optimization problem is designed by modifying the Max-Min Ant System (MMAS) algorithm. To evaluate the success of the proposed method, an alternative approach, based…
Applications involving autonomous navigation and planning of mobile agents can benefit greatly by employing online Simultaneous Localization and Mapping (SLAM) techniques, however, their proper implementation still warrants an efficient amalgamation with any offline path planning method that may be used for the particular application. In this paper, such a case of amalgamation is considered for a LiDAR-based indoor mapping system which presents itself as a 2D coverage path planning problem implemented along with online SLAM. This paper shows how classic offline Coverage Path Planning (CPP) can…
Guangdong University of Technology（广东工业大学）；The Chinese University of Hong Kong, Shenzhen（香港中文大学（深圳））
Coverage path planning is a major application for mobile robots, which requires robots to move along a planned path to cover the entire map. For large-scale tasks, coverage path planning benefits greatly from multiple robots. In this paper, we describe Turn-minimizing Multirobot Spanning Tree Coverage Star(TMSTC*), an improved multirobot coverage path planning (mCPP) algorithm based on the MSTC*. Our algorithm partitions the map into minimum bricks as tree's branches and thereby transforms the problem into finding the maximum independent set of bipartite graph. We then connect bricks with gree…
Online coverage planning can be useful in applications like field monitoring and search and rescue. Without prior information of the environment, achieving resolution-complete coverage considering the non-holonomic mobility constraints in commonly-used vehicles (e.g., wheeled robots) remains a challenge. In this paper, we propose a hierarchical, hex-decomposition-based coverage planning algorithm for unknown, obstacle-cluttered environments. The proposed approach ensures resolution-complete coverage, can be tuned to achieve fast exploration, and plans smooth paths for Dubins vehicles to follow…
Autonomous Systems Lab, ETH Zurich（苏黎世联邦理工学院自主系统实验室）
In this paper, we present a path planner for low-altitude terrain coverage in known environments with unmanned rotary-wing micro aerial vehicles (MAVs). Airborne systems can assist humanitarian demining by surveying suspected hazardous areas (SHAs) with cameras, ground-penetrating synthetic aperture radar (GPSAR), and metal detectors. Most available coverage planner implementations for MAVs do not consider obstacles and thus cannot be deployed in obstructed environments. We describe an open source framework to perform coverage planning in polygon flight corridors with obstacles. Our planner ex…
A*STAR Artificial Intelligence Initiative (A*AI)（新加坡科技研究局人工智能计划（A*AI））；Institute of High Performance Computing（高性能计算研究所）；Carnegie Mellon University（卡内基梅隆大学）
Planning the path to gather the surface information of the target objects is crucial to improve the efficiency of and reduce the overall cost, for visual inspection applications with Unmanned Aerial Vehicles (UAVs). Coverage Path Planning (CPP) problem is often formulated for these inspection applications because of the coverage requirement. Traditionally, researchers usually plan and optimize the viewpoints to capture the surface information first, and then optimize the path to visit the selected viewpoints. In this paper, we propose a novel planning method to directly sample and plan the ins…
Shanghai Key Laboratory of Trustworthy Computing（上海市可信计算重点实验室）；Engineering Research Center of Software/Hardware Co-design Technology and Application (MoE)（软硬件协同设计技术与应用教育部工程研究中心）；School of Software Engineering, East China Normal University（华东师范大学软件工程学院）
For large-scale tasks, coverage path planning (CPP) can benefit greatly from multiple robots. In this paper, we present an efficient algorithm MSTC* for multi-robot coverage path planning (mCPP) based on spiral spanning tree coverage (Spiral-STC). Our algorithm incorporates strict physical constraints like terrain traversability and material load capacity. We compare our algorithm against the state-of-the-art in mCPP for regular grid maps and real field terrains in simulation environments. The experimental results show that our method significantly outperforms existing spiral-STC based mCPP me…
Stony Brook University（石溪大学）；Dalian University of Technology（大连理工大学）
Robot Coverage Path planning (i.e., provide full coverage of a given domain by one or multiple robots) is a classical problem in the field of robotics and motion planning. The goal is to provide nearly full coverage while also minimize duplicately visited area. In this paper we focus on the scenario of path planning on general surfaces including planar domains with complex topology, complex terrain or general surface in 3D space. The main idea is to adopt a natural, intrinsic and global parametrization of the surface for robot path planning, namely the holomorphic quadratic differentials. Exce…
A*STAR Institute of Information Research (IR)（新加坡科技研究局信息研究所）；A*STAR Institute of High Performance Computing (IHPC)（新加坡科技研究局高性能计算研究所）；A*STAR Initiative for Artificial Intelligence and Analytics (AI)（新加坡科技研究局人工智能与分析计划）；Department of Mechanical Engineering, Carnegie Mellon University（卡内基梅隆大学机械工程系）
We present a multi-UAV Coverage Path Planning (CPP) framework for the inspection of large-scale, complex 3D structures. In the proposed sampling-based coverage path planning method, we formulate the multi-UAV inspection applications as a multi-agent coverage path planning problem. By combining two NP-hard problems: Set Covering Problem (SCP) and Vehicle Routing Problem (VRP), a Set-Covering Vehicle Routing Problem (SC-VRP) is formulated and subsequently solved by a modified Biased Random Key Genetic Algorithm (BRKGA) with novel, efficient encoding strategies and local improvement heuristics. W…
TRACE: Coverage Path Planning for Unknown Environments Using Hierarchical Coverage Tree
Jinan University（暨南大学）；University of Chinese Academy of Sciences（中国科学院大学）；Shanghai Jiao Tong University（上海交通大学）；Wuyi University（五邑大学）；South China University of Technology（华南理工大学）
Thanks to the rapid evolvement of robotic technologies, robot mowing is emerging to liberate humans from the tedious and time-consuming landscape work. Traditionally, robot mowing is perceived as a "Coverage Path Planning" problem, with a simplification that converts non-convex obstacles into convex obstacles. Besides, the converted obstacles are commonly dilated by the robot's circumcircle for collision avoidance. However when applied to robot mowing, an obstacle in a lawn is usually non-convex, imagine a garden on the lawn, such that the mentioned obstacle processing methods would fill in so…
This article addresses the problem of Cooperative Coverage Path Planning (C-CPP) for the inspection of complex infrastructures (offline 3D reconstruction) by utilizing multiple Unmanned Autonomous Vehicles (UAVs). The proposed scheme, based on a priori 3D model of the infrastructure under inspection, is able to generate multiple paths for UAVs in order to achieve a complete cooperative coverage in a short time. Initially the infrastructure under inspection is being sliced by horizontal planes, which has the capability of recognizing the branches of the structure and these branches will be hand…
Coverage Path Planning for Autonomous Sailboats in Inhomogeneous and Time-Varying Oceans: A Spatiotemporal Optimization Approach
Institute of Deep-sea Science and Engineering, Chinese Academy of Sciences（中国科学院深海科学与工程研究所）；Institute for Ocean Engineering, Shenzhen International Graduate School, Tsinghua University（清华大学深圳国际研究生院海洋工程研究所）；ZJU-Hangzhou Global Scientific and Technological Innovation Center, Zhejiang University（浙江大学 Hangzhou 全球科技创新中心）；Department of Engineering, Faculty of Computing, Engineering and the Built Environment, Birmingham City University（伯明翰城市大学工程系）；School of Ocean and Civil Engineering, Shanghai Jiao Tong University（上海交通大学海洋与Civil Engineering学院）
The Hong Kong University of Science and Technology（香港科技大学）；The Hong Kong Polytechnic University（香港理工大学）；the University of California San Diego（加州大学圣迭戈分校）
Path planning is a fundamental capability for autonomous navigation of robotic wheelchairs. With the impressive development of deep-learning technologies, imitation learning-based path planning approaches have achieved effective results in recent years. However, the disadvantages of these approaches are twofold: 1) they may need extensive time and labor to record expert demonstrations as training data; and 2) existing approaches could only receive high-level commands, such as turning left/right. These commands could be less sufficient for the navigation of mobile robots (e.g., robotic wheelcha…
The land used for grazing cattle takes up about one-third of the land in the United States. These areas can be highly rugged. Yet, they need to be maintained to prevent weeds from taking over the nutritious grassland. This can be a daunting task especially in the case of organic farming since herbicides cannot be used. In this paper, we present the design of Cowbot, an autonomous weed mowing robot for pastures. Cowbot is an electric mower designed to operate in the rugged environments on cow pastures and provide a cost-effective method for weed control in organic farms. Path planning for the C…
University of Bonn（波恩大学）；Queensland University of Technology (QUT)（昆士兰科技大学）
Obtaining 3D sensor data of complete plants or plant parts (e.g., the crop or fruit) is difficult due to their complex structure and a high degree of occlusion. However, especially for the estimation of the position and size of fruits, it is necessary to avoid occlusions as much as possible and acquire sensor information of the relevant parts. Global viewpoint planners exist that suggest a series of viewpoints to cover the regions of interest up to a certain degree, but they usually prioritize global coverage and do not emphasize the avoidance of local occlusions. On the other hand, there are …
California Institute of Technology（加州理工学院）；Stanford University（斯坦福大学）；NASA Jet Propulsion Laboratory（美国国家航空航天局喷气推进实验室）；University of California Los Angeles（加州大学洛杉矶分校）
We present a method for solving the coverage problem with the objective of autonomously exploring an unknown environment under mission time constraints. Here, the robot is tasked with planning a path over a horizon such that the accumulated area swept out by its sensor footprint is maximized. Because this problem exhibits a diminishing returns property known as submodularity, we choose to formulate it as a tree-based sequential decision making process. This formulation allows us to evaluate the effects of the robot's actions on future world coverage states, while simultaneously accounting for …
Robotics Institute（机器人研究所）；University of Michigan（密歇根大学）；J.P. Morgan AI Research（摩根大通AI研究院）
Recent advances in computational perception have significantly improved the ability of autonomous robots to perform state estimation with low entropy. Such advances motivate a reconsideration of robot decision-making under uncertainty. Current approaches to solving sequential decision-making problems model states as inhabiting the extremes of the perceptual entropy spectrum. As such, these methods are either incapable of overcoming perceptual errors or asymptotically inefficient in solving problems with low perceptual entropy. With low entropy perception in mind, we aim to explore a happier me…
MDCPP: Multi-Robot Dynamic Coverage Path Planning for Workload Adaptation
School of Electrical and Automation Engineering, Nanjing Normal University（南京师范大学电气与自动化工程学院）；Computer, Electrical, and Mathematical Science and Engineering Division, King Abdullah University of Science and Technology（王国 Abdullah 科学与技术大学计算机、电气和数学科学与工程系）
Coverage of an inaccessible or challenging region with potential health and safety hazards, such as in a volcanic region, is difficult yet crucial from scientific and meteorological perspectives. Areas contained within the region often provide valuable information of varying importance. We present an algorithm to optimally cover a volcanic region in Hawai`i with an unmanned aerial vehicle (UAV). The target region is assigned with a nonuniform coverage importance score distribution. For a specified battery capacity of the UAV, the optimization problem seeks the path that maximizes the total cov…
LAGO Policy: Latency-Aware Asynchronous Diffusion Policies with Goal-Directed Collision-Free Planning for Smooth Manipulation
The Hong Kong University of Science and Technology (Guangzhou)（香港科技大学（广州））；International Digital Economy Academy（国际数字经济学院）；The University of Hong Kong（香港大学）；Southern University of Science and Technology（南方科技大学）
Coverage Path Planning involves visiting every unoccupied state in an environment with obstacles. In this paper, we explore this problem in environments which are initially unknown to the agent, for purposes of simulating the task of a vacuum cleaning robot. A survey of prior work reveals sparse effort in applying learning to solve this problem. In this paper, we explore modeling a Cover Path Planning problem using Deep Reinforcement Learning, and compare it with the performance of the built-in algorithm of the Roomba, a popular vacuum cleaning robot.
Optimal Planning for Multi-Robot Simultaneous Area and Line Coverage Using Hierarchical Cyclic Merging Regulation
Department of Mechanical and Aerospace Engineering, Rutgers University（机械与航空航天工程系，罗格斯大学）；Department of Mechanical Engineering, Binghamton University（机械工程系，宾州大学布林茅尔分校）
Multi-Depth Uniform Coverage Path Planning for Unmanned Surface Vehicle Surveying
AZTI Foundation（AZTI基金会）；Tsinghua University（清华大学）；University of the Basque Country (UPV/EHU)（巴斯克国家大学（UPV/EHU））；University of Technology Sydney（悉尼技术大学）；IKERBASQUE
Intelligent Systems Center（智能系统中心）；Johns Hopkins Applied Physics Lab（约翰斯·霍普金斯应用物理实验室）
The goal of meta-learning is to generalize to new tasks and goals as quickly as possible. Ideally, we would like approaches that generalize to new goals and tasks on the first attempt. Toward that end, we introduce contextual planning networks (CPN). Tasks are represented as goal images and used to condition the approach. We evaluate CPN along with several other approaches adapted for zero-shot goal-directed meta-learning. We evaluate these approaches across 24 distinct manipulation tasks using Metaworld benchmark tasks. We found that CPN outperformed several approaches and baselines on one ta…
Algorithmic approaches to exhaustive coverage have application in video games, enabling automatic game level exploration. Current designs use simple heuristics that frequently result in poor performance or exhibit unnatural behaviour. In this paper, we introduce a novel algorithm for covering a 2D polygonal (with holes) area. We assume prior knowledge of the map layout and use a grid-based world representation. Experimental analysis over several scenarios ranging from simple layouts to more complex maps used in actual games show good performance. This work serves as an initial step towards bui…
