← Search

Mark E. Campbell

7 accepted papers

2020

Mixed-Integer Linear Programming Models for Multi-Robot Non-Adversarial Search

RA-L 2020

In this letter, we consider the Multi-Robot Efficient Search Path Planning (MESPP) problem, where a team of robots is deployed in a graph-represented environment to capture a moving target within a given deadline. We prove this problem to be NP-hard, and present the first set of Mixed-Integer Linear

Cited by 22SourcecodeScholar
2020

Path Planning Under Malicious Injections and Removals of Perceived Obstacles: A Probabilistic Programming Approach

RA-L 2020

An autonomous mobile robot may encounter adversarial environments in which an attacker tries to influence its decisions. Through physical or software-level attacks, some of the robot's sensors might be compromised-a special concern for self-driving vehicles. Motivated by this scenario, this letter i

Cited by 4SourceScholar
2019

Pedestrian Motion Model Using Non-Parametric Trajectory Clustering and Discrete Transition Points

RA-L 2019

This letter presents a pedestrian motion model that includes both low level trajectory patterns, and high level discrete transitions. The inclusion of both levels creates a more general predictive model, allowing for more meaningful prediction and reasoning about pedestrian trajectories, as compared

Cited by 15SourceScholar
2017

An Adaptable, Probabilistic, Next-Best View Algorithm for Reconstruction of Unknown 3-D Objects

RA-L 2017

Autonomous mobile robots perform many tasks, such as grasping and inspection, that may require complete models of three-dimensional (3-D) objects in the environment. If little or no knowledge about an object is known a priori, the robot must take sensor measurements from strategically determined vie

Cited by 78SourceScholar