DeepAI AI Chat
Log In Sign Up

Inferring Obstacles and Path Validity from Visibility-Constrained Demonstrations

by   Craig Knuth, et al.

Many methods in learning from demonstration assume that the demonstrator has knowledge of the full environment. However, in many scenarios, a demonstrator only sees part of the environment and they continuously replan as they gather information. To plan new paths or to reconstruct the environment, we must consider the visibility constraints and replanning process of the demonstrator, which, to our knowledge, has not been done in previous work. We consider the problem of inferring obstacle configurations in a 2D environment from demonstrated paths for a point robot that is capable of seeing in any direction but not through obstacles. Given a set of survey points, which describe where the demonstrator obtains new information, and a candidate path, we construct a Constraint Satisfaction Problem (CSP) on a cell decomposition of the environment. We parameterize a set of obstacles corresponding to an assignment from the CSP and sample from the set to find valid environments. We show that there is a probabilistically-complete, yet not entirely tractable, algorithm that can guarantee novel paths in the space are unsafe or possibly safe. We also present an incomplete, but empirically-successful, heuristic-guided algorithm that we apply in our experiments to 1) planning novel paths and 2) recovering a probabilistic representation of the environment.


page 1

page 2

page 3

page 4


Path Finding for the Coalition of Co-operative Agents Acting in the Environment with Destructible Obstacles

The problem of planning a set of paths for the coalition of robots (agen...

An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles

We study a path-planning problem amid a set O of obstacles in R^2, in wh...

Autonomous Parking by Successive Convexification and Compound State Triggers

In this paper, we propose an algorithm for optimal generation of nonholo...

Does a robot path have clearance c?

Most path planning problems among polygonal obstacles ask to find a path...

Active Adversarial Evader Tracking with a Probabilistic Pursuer under the Pursuit-Evasion Game Framework

Given a mapped environment, we formulate the problem of visually trackin...

Environmental Sampling with the Boustrophedon Decomposition Algorithm

The automation of data collection via mobile robots holds promise for in...

Rectilinear Shortest Paths Among Transient Obstacles

This paper presents an optimal Θ(n n) algorithm for determining time-mi...