7 citations · 9 across the 6 of their papers we have counts for
6 papers
Robust-by-Design Plans for Multi-Robot Pursuit-Evasion
Trevor Olsen, Nicholas M. Stiffler, Jason M. O'Kane
This paper studies a multi-robot visibility-based pursuit-evasion problem in which a group of pursuer robots are tasked with detecting an evader within a two dimensional polygonal…
Rapid Recovery from Robot Failures in Multi-Robot Visibility-Based Pursuit-Evasion
Trevor Olsen, Nicholas M. Stiffler, Jason M. O'Kane
This paper addresses the visibility-based pursuit-evasion problem where a team of pursuer robots operating in a two-dimensional polygonal space seek to establish visibility of an a…
A Visibility Roadmap Sampling Approach for a Multi-Robot Visibility-Based Pursuit-Evasion Problem
Trevor Olsen, Anne M. Tumlin, Nicholas M. Stiffler +1
Given a two-dimensional polygonal space, the multi-robot visibility-based pursuit-evasion problem tasks several pursuer robots with the goal of establishing visibility with an arbi…
Minimum Wiener Index of Triangulations and Quadrangulations
Éva Czabarka, Trevor Olsen, Stephen Smith +1
The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide formulae for the minimum Wiener index of simple triangulations…
Proximity in Triangulations and Quadrangulations
Éva Czabarka, Peter Dankelmann, Trevor Olsen +1
Let be a connected graph. If denotes the arithmetic mean of the distances from to all other vertices of , then the proximity, , of is defined as t…
Wiener Index and Remoteness in Triangulations and Quadrangulations
Éva Czabarka, Peter Dankelmann, Trevor Olsen +1
Let be a a connected graph. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide asymptotic formulae for the ma…