Kevin Leahy

Kevin Leahy

Auto-generated profile, based on publicly available information

Kevin Leahy

Robotics Engineering Department, Worcester Polytechnic Institute, Worcester, MA, USA

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 December 2021 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
KLKevin Leahy
Kevin Leahy
ZSZachary Serlin
Zachary Serlin
CVCristian-Ioan Vasile
Cristian-Ioan Vasile
ASAndrew Schoer
Andrew Schoer
AJAustin M. Jones
Austin M. Jones
CBCalin Belta
Calin Belta
Many existing approaches for coordinating heterogeneous teams of robots either consider small numbers of agents, are application-specific, or do not adequately address common real-world requirements, e.g., strict deadlines or intertask dependencies. We introduce scalable and robust algorithms for task-based coordination from high-level specifications (ScRATCHeS) to coordinate such teams. We define a specification language, capability temporal logic, to describe rich, temporal properties involving tasks requiring the participation of multiple agents with multiple capabilities, e.g., sensors or end effectors. Arbitrary missions and team dynamics are jointly encoded as constraints in a mixed integer linear program, and solved efficiently using commercial off-the-shelf solvers. ScRATCHeS optionally allows optimization for maximal robustness to agent attrition at the penalty of increased computation time. We include an online replanning algorithm that adjusts the plan after an agent has dropped out. The flexible specification language, fast solution time, and optional robustness of ScRATCHeS provide a first step toward a multipurpose on-the-fly planning tool for tasking large teams of agents with multiple capabilities enacting missions with multiple tasks. We present randomized computational experiments to characterize scalability and hardware demonstrations to illustrate the applicability of our methods.

5 November 2015 in Autonomous Robots
Verified
Journal Article
Closed access
PDF file
KLKevin Leahy
Kevin Leahy
DZDingjiang Zhou
Dingjiang Zhou
CVCristian-Ioan Vasile
Cristian-Ioan Vasile
KOKonstantinos Oikonomopoulos
Konstantinos Oikonomopoulos
MSMac Schwager
Mac Schwager
CBCalin Belta
Calin Belta

7 February 2022 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
KYKasra Yazdani
Kasra Yazdani
AJAustin Jones
Austin Jones
KLKevin Leahy
Kevin Leahy
MHMatthew Hale
Matthew Hale
As multi-agent systems proliferate and share more user data, new approaches are needed to protect sensitive data while still enabling system operation. To address this need, this paper presents a private multi-agent LQ control framework. Agents' state trajectories can be sensitive and we therefore protect them using differential privacy. We quantify the impact of privacy along three dimensions: the amount of information shared under privacy, the control-theoretic cost of privacy, and the tradeoffs between privacy and performance. These analyses are done in conventional control-theoretic terms, which we use to develop guidelines for calibrating privacy as a function of system parameters. Numerical results indicate that system performance remains within desirable ranges, even under strict privacy requirements.

14 January 2022 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
KLKevin Leahy
Kevin Leahy
AJAustin Jones
Austin Jones
CVCristian-Ioan Vasile
Cristian-Ioan Vasile
We focus on decomposing large multi-agent path planning problems with global temporal logic goals (common to all agents) into smaller sub-problems that can be solved and executed independently. Crucially, the sub-problems’ solutions must jointly satisfy the common global mission specification. The agents’ missions are given as Capability Temporal Logic (CaTL) formulas, a fragment of Signal Temporal Logic (STL) that can express properties over tasks involving multiple agent capabilities (i.e., different combinations of sensors, effectors, and dynamics) under strict timing constraints. We jointly decompose both the temporal logic specification and the team of agents, using a satisfiability modulo theories (SMT) approach and heuristics for handling temporal operators. The output of the SMT is then distributed to subteams and leads to a significant speed up in planning time compared to planning for the entire team and specification. We include computational results to evaluate the efficiency of our solution, as well as the trade-offs introduced by the conservative nature of the SMT encoding and heuristics.

28 April 2019 in The International Journal of Robotics Research
Verified
Journal Article
Open access
PDF file
KLKevin Leahy
Kevin Leahy
ECEric Cristofalo
Eric Cristofalo
CVCristian-Ioan Vasile
Cristian-Ioan Vasile
AJAustin Jones
Austin Jones
EMEduardo Montijano
Eduardo Montijano
CBCalin Belta
Calin Belta
We present a solution for operating a vehicle without global positioning infrastructure while satisfying constraints on its temporal behavior, and on the uncertainty of its position estimate. The proposed solution is an end-to-end framework for mapping an unknown environment using aerial vehicles, synthesizing a control policy for a ground vehicle in that environment, and using a quadrotor to localize the ground vehicle within the map while it executes its control policy. This vision-based localization is noisy, necessitating planning in the belief space of the ground robot. The ground robot’s mission is given using a language called Gaussian Distribution Temporal Logic (GDTL), an extension of Boolean logic that incorporates temporal evolution and noise mitigation directly into the task specifications. We use a sampling-based algorithm to generate a transition system in the belief space and use local feedback controllers to break the curse of history associated with belief space planning. To localize the vehicle, we build a high-resolution map of the environment by flying a team of aerial vehicles in formation with sensor information provided by their onboard cameras. The control policy for the ground robot is synthesized under temporal and uncertainty constraints given the semantically labeled map. Then the ground robot can execute the control policy given pose estimates from a dedicated aerial robot that tracks and localizes the ground robot. The proposed method is validated using two quadrotors to build a map, followed by a two-wheeled ground robot and a quadrotor with a camera for ten successful experimental trials.

1 December 2016
Verified
Conference Paper
Closed access
CVCristian-Ioan Vasile
Cristian-Ioan Vasile
KLKevin Leahy
Kevin Leahy
ECEric Cristofalo
Eric Cristofalo
AJAustin Jones
Austin Jones
MSMac Schwager
Mac Schwager
CBCalin Belta
Calin Belta
In this paper, we present a sampling-based algorithm to synthesize control policies with temporal and uncertainty constraints. We introduce a specification language called Gaussian Distribution Temporal Logic (GDTL), an extension of Boolean logic that allows us to incorporate temporal evolution and noise mitigation directly into the task specifications, e.g. “Go to region A and reduce the variance of your state estimate below 0.1 m 2 .” Our algorithm generates a transition system in the belief space and uses local feedback controllers to break the curse of history associated with belief space planning. Furthermore, conventional automata-based methods become tractable. Switching control policies are then computed using a product Markov Decision Process (MDP) between the transition system and the Rabin automaton encoding the task specification. We present algorithms to translate a GDTL formula to a Rabin automaton and to efficiently construct the product MDP by leveraging recent results from incremental computing. Our approach is evaluated in hardware experiments using a camera network and ground robot.