2013 IEEE/RSJ International Conference on Intelligent Robots and Systems 2013
DOI: 10.1109/iros.2013.6697189
|View full text |Cite
|
Sign up to set email alerts
|

Planning for opportunistic surveillance with multiple robots

Abstract: Abstract-We are interested in the multiple robot surveillance problem where robots must allocate waypoints to be visited among themselves and plan paths through different waypoints while avoiding obstacles. Furthermore, the robots are allocated specific times to reach their respective goal locations and as a result they have to decide which robots have to visit which waypoints. Such a problem has the challenge of computing the allocation of waypoints across robots, ordering for these waypoints and dynamical fe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
19
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 36 publications
(19 citation statements)
references
References 31 publications
(35 reference statements)
0
19
0
Order By: Relevance
“…Another similar problem is the Team Orienteering Problem, where robots maximize the number of covered waypoints visited, with constraints on the total travel time of each robot. In order to solve this problem and optimize the overall planning time, an algorithm was proposed that uses a three-tier graph, interleaving the search for optimal waypoint assignment, ordering of the waypoints and also considering feasible paths between waypoints while avoiding obstacles [33]. This algorithm guarantees optimal solutions, while in our work we focus on sub-optimal planning for multi-robot teams.…”
Section: Related Workmentioning
confidence: 99%
“…Another similar problem is the Team Orienteering Problem, where robots maximize the number of covered waypoints visited, with constraints on the total travel time of each robot. In order to solve this problem and optimize the overall planning time, an algorithm was proposed that uses a three-tier graph, interleaving the search for optimal waypoint assignment, ordering of the waypoints and also considering feasible paths between waypoints while avoiding obstacles [33]. This algorithm guarantees optimal solutions, while in our work we focus on sub-optimal planning for multi-robot teams.…”
Section: Related Workmentioning
confidence: 99%
“…In an even broader perspective, a future objective is to develop a framework for a more general exploration problem where robots can "explore" other features of the environment, including its physical quantities, like in environmental monitoring (Parker, Coogle, and Howard, 2013;Smith, Schwager, Smith, Rus, and Sukhatme, 2011), surveillance (Carpin, Burch, Basilico, Chung, & Kölsch, 2013;Thakur et al, 2013), olfactory exploration (Marjovi & Marques, 2013), and tactile exploration (Pezzementi, Plaku, Reyda, & Hager, 2011), so that the development of a robotic system is eased.…”
Section: To Improve the Experimental Assessment Of Multi-robot Explormentioning
confidence: 99%
“…For example, a controller for FOLLOWLEFTWALL may have a trigger OPENINGONLEFT, whereas that trigger may not be valid for a controller performing VISUALSER-VOTOLANDMARK. 1 We classify triggers into two categories: intrinsic or extrinsic. Intrinsic triggers result from the natural completion of a controller.…”
Section: T(c) : C → P(t )mentioning
confidence: 99%
“…For example, aerial vehicles [1], automobiles [2], boats [3], and all-terrain vehicles [4] have all used state lattices for navigation. These graphs are constructed by applying a set of motion primitives to each state expanded during the search in order to generate valid successor states.…”
Section: Introductionmentioning
confidence: 99%