Hadas Kress-Gazit

Hadas Kress-Gazit

Auto-generated profile, based on publicly available information

Hadas Kress-Gazit

Sibley School of Mechanical and Aerospace Engineering, Cornell University, Ithaca, NY, USA

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
28 May 2018 in Annual Review of Control, Robotics, and Autonomous Systems
Verified
Journal Article
Closed access
HKHadas Kress-Gazit
Hadas Kress-Gazit
MLMorteza Lahijanian
Morteza Lahijanian
VRVasumathi Raman
Vasumathi Raman
Robot control for tasks such as moving around obstacles or grasping objects has advanced significantly in the last few decades. However, controlling robots to perform complex tasks is still accomplished largely by highly trained programmers in a manual, time-consuming, and error-prone process that is typically validated only through extensive testing. Formal methods are mathematical techniques for reasoning about systems, their requirements, and their guarantees. Formal synthesis for robotics refers to frameworks for specifying tasks in a mathematically precise language and automatically transforming these specifications into correct-by-construction robot controllers or into a proof that the task cannot be done. Synthesis allows users to reason about the task specification rather than its implementation, reduces implementation error, and provides behavioral guarantees for the resulting controller. This article reviews the current state of formal synthesis for robotics and surveys the landscape of abstractions, specifications, and synthesis algorithms that enable it.

18 January 2006
Verified
Conference Paper
Open access
GFG.E. Fainekos
G.E. Fainekos
HKH. Kress-Gazit
H. Kress-Gazit
GPG.J. Pappas
G.J. Pappas
In this paper, we consider the problem of robot motion planning in order to satisfy formulas expressible in temporal logics. Temporal logics naturally express traditional robot specifications such as reaching a goal or avoiding an obstacle, but also more sophisticated specifications such as sequencing, coverage, or temporal ordering of different tasks. In order to provide computational solutions to this problem, we first construct discrete abstractions of robot motion based on some environmental decomposition. We then generate discrete plans satisfying the temporal logic formula using powerful model checking tools, and finally translate the discrete plans to continuous trajectories using hybrid control. Critical to our approach is providing formal guarantees ensuring that if the discrete plan satisfies the temporal logic formula, then the continuous motion also satisfies the exact same formula.

17 October 2018 in Science Robotics
Verified
Journal Article
Closed access
PDF file
JDJonathan Daudelin
Jonathan Daudelin
GJGangyuan Jing
Gangyuan Jing
TTTarik Tosun
Tarik Tosun
MYMark Yim
Mark Yim
HKHadas Kress-Gazit
Hadas Kress-Gazit
MCMark Campbell
Mark Campbell
A robot autonomously completes tasks by transforming its body to match its capabilities to newly encountered environments.

12 August 2017 in Autonomous Robots
Verified
Journal Article
Open access
PDF file
JAJavier Alonso-Mora
Javier Alonso-Mora
JDJonathan A. DeCastro
Jonathan A. DeCastro
VRVasumathi Raman
Vasumathi Raman
DRDaniela Rus
Daniela Rus
HKHadas Kress-Gazit
Hadas Kress-Gazit
In the near future mobile robots, such as personal robots or mobile manipulators, will share the workspace with other robots and humans. We present a method for mission and motion planning that applies to small teams of robots performing a task in an environment with moving obstacles, such as humans. Given a mission specification written in linear temporal logic, such as patrolling a set of rooms, we synthesize an automaton from which the robots can extract valid strategies. This centralized automaton is executed by the robots in the team at runtime, and in conjunction with a distributed motion planner that guarantees avoidance of moving obstacles. Our contribution is a correct-by-construction synthesis approach to multi-robot mission planning that guarantees collision avoidance with respect to moving obstacles, guarantees satisfaction of the mission specification and resolves encountered deadlocks, where a moving obstacle blocks the robot temporally. Our method provides conditions under which deadlock will be avoided by identifying environment behaviors that, when encountered at runtime, may prevent the robot team from achieving its goals. In particular, (1) it identifies deadlock conditions; (2) it is able to check whether they can be resolved; and (3) the robots implement the deadlock resolution policy locally in a distributed manner. The approach is capable of synthesizing and executing plans even with a high density of dynamic obstacles. In contrast to many existing approaches to mission and motion planning, it is scalable with the number of moving obstacles. We demonstrate the approach in physical experiments with walking humanoids moving in 2D environments and in simulation with aerial vehicles (quadrotors) navigating in 2D and 3D environments.

8 March 2021 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
DGDavid Gundana
David Gundana
HKHadas Kress-Gazit
Hadas Kress-Gazit
We propose a new specification language and control synthesis technique for single and multi-robot high-level tasks; these tasks include timing constraints and reaction to environmental events. Specifically, we define Event-based Signal Temporal Logic (STL) and use it to encode tasks that are reactive to uncontrolled environment events. Our control synthesis approach to Event-based STL tasks combines automata and control barrier functions to produce robot behaviors that satisfy the specification when possible. Our method automatically provides feedback to the user if an Event-based STL task cannot be achieved. We demonstrate the effectiveness of the framework through simulations and physical demonstrations of multi-robot tasks.

8 February 2018 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
MLMorteza Lahijanian
Morteza Lahijanian
MSMaria Svorenova
Maria Svorenova
AMAkshay A. Morye
Akshay A. Morye
BYBrian Yeomans
Brian Yeomans
DRDushyant Rao
Dushyant Rao
MKMarta Kwiatkowska
Marta Kwiatkowska
The design of mobile autonomous robots is challenging due to the limited on-board resources such as processing power and energy. A promising approach is to generate intelligent schedules that reduce the resource consumption while maintaining best performance, or more interestingly, to tradeoff reduced resource consumption for a slightly lower but still acceptable level of performance. In this letter, we provide a framework that is automatic and quantitative to aid designers in exploring such resource-performance tradeoffs and finding schedules for mobile robots, guided by questions such as “what is the minimum resource budget required to achieve a given level of performance?” The framework is based on a quantitative multiobjective verification technique, which, for a collection of possibly conflicting objectives, produces the Pareto front that contains all the achievable optimal tradeoffs. The designer then selects a specific Pareto point based on the resource constraints and desired performance level, and a correct-by-construction schedule that meets those constraints is automatically generated. We demonstrate the efficacy of this framework on several robotic scenarios in both simulations and experiments.