Browsing by Author "Lahijanian, Morteza"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Automated Abstraction of Manipulation Domains for Cost-Based Reactive Synthesis
    (IEEE, 2019) He, Keliang; Lahijanian, Morteza; Kavraki, Lydia E.; Vardi, Moshe Y.
    When robotic manipulators perform high-level tasks in the presence of another agent, e.g., a human, they must have a strategy that considers possible interferences in order to guarantee task completion and efficient resource usage. One approach to generate such strategies is called reactive synthesis. Reactive synthesis requires an abstraction, which is a discrete structure that captures the domain in which the robot and other agents operate. Existing works discuss the construction of abstractions for mobile robots through space decomposition; however, they cannot be applied to manipulation domains due to the curse of dimensionality caused by the manipulator and the objects. In this work, we present the first algorithm for automatic abstraction construction for reactive synthesis of manipulation tasks. We focus on tasks that involve picking and placing objects with possible extensions to other types of actions. The abstraction also provides an upper bound on path-based costs for robot actions. We combine this abstraction algorithm with our reactive synthesis planner to construct correct-by-construction plans. We demonstrate the power of the framework on a UR5 robot, completing complex tasks in face of interferences by a human.
  • Thumbnail Image
    Item
    Iterative Temporal Motion Planning for Hybrid Systems in Partially Unknown Environments
    (ACM, 2013) Maly, Matthew R.; Lahijanian, Morteza; Kavraki, Lydia E.; Kress-Gazit, Hadas; Vardi, Moshe Y.
    This paper considers the problem of motion planning for a hybrid robotic system with complex and nonlinear dynamics in a partially unknown environment given a temporal logic specification. We employ a multi-layered synergistic framework that can deal with general robot dynamics and combine it with an iterative planning strategy. Our work allows us to deal with the unknown environmental restrictions only when they are discovered and without the need to repeat the computation that is related to the temporal logic specification. In addition, we define a metric for satisfaction of a specification. We use this metric to plan a trajectory that satisfies the specification as closely as possible in cases in which the discovered constraint in the environment renders the specification unsatisfiable. We demonstrate the efficacy of our framework on a simulation of a hybrid second-order car-like robot moving in an office environment with unknown obstacles. The results show that our framework is successful in generating a trajectory whose satisfaction measure of the specification is optimal. They also show that, when new obstacles are discovered, the reinitialization of our framework is computationally inexpensive.