ICRA 2012 Paper Abstract

Close

Paper WeC310.4

Mahadevan, Aditya (Texas A&M University), Amato, Nancy (Texas A&M University)

A Sampling-Based Approach to Probabilistic Pursuit Evasion

Scheduled for presentation during the Interactive Session "Interactive Session WeC-3" (WeC310), Wednesday, May 16, 2012, 15:30−16:00, Ballroom D

2012 IEEE International Conference on Robotics and Automation, May 14-18, 2012, RiverCentre, Saint Paul, Minnesota, USA

This information is tentative and subject to change. Compiled on June 18, 2018

Keywords Behavior-Based Systems, Path Planning for Multiple Mobile Robots or Agents, Search and Rescue Robots

Abstract

Probabilistic roadmaps (PRMs) are a sampling-based approach to motion-planning that encodes feasible paths through the environment using a graph created from a subset of valid positions. Prior research has shown that PRMs can be augmented with useful information to model interesting scenarios related to multi-agent interaction and coordination.

Pursuit evasion is the problem of planning the motions of one or more agents to effectively track and/or capture an initially unseen evader in a closed environment.

Unlike prior probabilistic approaches that assume the environment is partitioned into convex cells or square grids, we present a sampling-based technique that allows us to generalize the problem to an arbitrary partitioning of the environment. We then show how PRMs can exploit this method using Voronoi diagrams. We discuss the theoretical underpinnings of this approach and demonstrate its validity experimentally.

 

 

Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2018 PaperCept, Inc.
Page generated 2018-06-18  00:56:51 PST  Terms of use