Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Adam Pacheck

dblp:241/4190 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
2since 2021 · last 2023
0000-0002-4349-1888ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-author · 1 since 2021Systems, architecture and hardware · 3 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Planning, search and constraint satisfaction · 51% Motion planning and robot control · 26% Reinforcement learning · 14%
Theoretical computer science
2 papers
Logic in computer science · 78% Automated reasoning and model checking · 22%
Human-computer interaction and pervasive computing
1 paper
Human-robot interaction · 100%

Topics — the 12 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
robot task planning
0.712023
Physically Feasible Repair of Reactive, Linear Temporal Logic-Based, High-Level Tasks · IEEE Trans. Robotics 2023
Robotics › Motion planning and robot control
temporal logic specification
0.712023
Physically Feasible Repair of Reactive, Linear Temporal Logic-Based, High-Level Tasks · IEEE Trans. Robotics 2023
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
partially observable planning
0.512021
Learning and Planning for Temporally Extended Tasks in Unknown Environments · ICRA 2021
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › temporal planning
temporal logic planning
0.512021
Learning and Planning for Temporally Extended Tasks in Unknown Environments · ICRA 2021
Robotics › Motion planning and robot control
robot control
0.412020
Finding Missing Skills for High-Level Behaviors · ICRA 2020
Machine learning › Reinforcement learning › hierarchical reinforcement learning
skill learning
0.412020
Finding Missing Skills for High-Level Behaviors · ICRA 2020
Robotics › Robot navigation and mapping
social navigation
0.412019
SMT-Based Control and Feedback for Social Navigation · ICRA 2019
Human-robot interaction › robot navigation
socially-aware robot navigation
0.412019
SMT-Based Control and Feedback for Social Navigation · ICRA 2019
Logic in computer science › temporal logic
linear temporal logic
0.212023
Physically Feasible Repair of Reactive, Linear Temporal Logic-Based, High-Level Tasks · IEEE Trans. Robotics 2023
Logic in computer science
temporal logic
0.212023
Physically Feasible Repair of Reactive, Linear Temporal Logic-Based, High-Level Tasks · IEEE Trans. Robotics 2023
Machine learning › Reinforcement learning
exploration
0.112021
Learning and Planning for Temporally Extended Tasks in Unknown Environments · ICRA 2021
Automated reasoning and model checking
satisfiability modulo theories
0.112019
SMT-Based Control and Feedback for Social Navigation · ICRA 2019

Methods — techniques the papers use, named apart from their topics

symbolic repair · 1.3physical feasibility checking · 1.3satisfiability modulo theories · 1.1formal specification · 1.1neural network · 0.5learned action model · 0.5synthesis · 0.4linear temporal logic · 0.4
YearPublicationVenuePosition
2023 Physically Feasible Repair of Reactive, Linear Temporal Logic-Based, High-Level Tasks
abstract
A typical approach to creating complex robot behaviors is to compose atomic controllers, or skills, such that the resulting behavior satisfies a high-level task; however, when a task cannot be accomplished with a given set of skills, it is difficult to know how to modify the skills to make the task possible. We present a method for combining symbolic repair with physical feasibility checking and implementation to automatically modify existing skills such that the robot can execute a previously infeasible task. We encode robot skills in linear temporal logic (LTL) formulas that capture both safety constraints and goals for reactive tasks. Furthermore, our encoding captures the full skill execution, as opposed to prior work where only the state of the world before and after the skill is executed are considered. Our repair algorithm suggests symbolic modifications, then attempts to physically implement the suggestions by modifying the original skills subject to Linear Temporal Logic (LTL) constraints derived from the symbolic repair. If skills are not physically possible, we automatically provide additional constraints for the symbolic repair. We demonstrate our approach with a Baxter and a Clearpath Jackal.
Adam Pacheck, Hadas Kress-Gazit
IEEE Trans. Robotics1
2021 Learning and Planning for Temporally Extended Tasks in Unknown Environments
abstract
We propose a novel planning technique for satisfying tasks specified in temporal logic in partially revealed environments. We define high-level actions derived from the environment and the given task itself, and estimate how each action contributes to progress towards completing the task. As the map is revealed, we estimate the cost and probability of success of each action from images and an encoding of that action using a trained neural network. These estimates guide search for the minimum-expected-cost plan within our model. Our learned model is structured to generalize across environments and task specifications without requiring retraining. We demonstrate an improvement in total cost in both simulated and real-world experiments compared to a heuristic-driven baseline.
Christopher Bradley, Adam Pacheck, Gregory J. Stein, Sebastian Castro, Hadas Kress-Gazit, Nicholas Roy
ICRA2
2020 Finding Missing Skills for High-Level Behaviors
abstract
Recently, Linear Temporal Logic (LTL) has been used as a formalism for defining high-level robot tasks, and LTL synthesis has been used to automatically create correct-by-construction robot control. The underlying premise of this approach is that the robot has a set of actions, or skills, that can be composed to achieve the high- level task. In this paper we consider LTL specifications that cannot be synthesized into robot control due to lack of appropriate skills; we present algorithms for automatically suggesting new or modified skills for the robot that will guarantee the task will be achieved. We demonstrate our approach with a physical Baxter robot and a simulated KUKA IIWA arm.
Adam Pacheck, Salar Moarref, Hadas Kress-Gazit
ICRA1
2019 SMT-Based Control and Feedback for Social Navigation
abstract
This paper combines techniques from Formal Methods and Human-Robot Interaction (HRI) to address the challenge of a robot walking with a human while maintaining a socially acceptable distance and avoiding collisions. We formulate a set of constraints on the robot motion using Satisfiability Modulo Theories (SMT) formulas, and synthesize robot control that is guaranteed to be safe and correct. Due to its use of high-level formal specifications, the controller is able to provide feedback to the user in situations where human behavior causes the robot to fail. This feedback allows the human to adjust their behavior and recover joint navigation. We demonstrate the behavior of the robot in a variety of simulated scenarios and compare it to utility-based side-by-side navigation control.
Thais Campos, Adam Pacheck, Guy Hoffman, Hadas Kress-Gazit
ICRA2
2019 Automatic Encoding and Repair of Reactive High-Level Tasks with Learned Abstract Representations
Adam Pacheck, George Dimitri Konidaris, Hadas Kress-Gazit
ISRR1