Award Abstract # 1117325
RI: Small: Hierarchical Planning for Robots in Complex Uncertain Domains

NSF Org: IIS
Division of Information & Intelligent Systems
Recipient: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
Initial Amendment Date: August 8, 2011
Latest Amendment Date: August 8, 2011
Award Number: 1117325
Award Instrument: Standard Grant
Program Manager: Hector Munoz-Avila
hmunoz@nsf.gov
 (703)292-4481
IIS
 Division of Information & Intelligent Systems
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: August 1, 2011
End Date: July 31, 2014 (Estimated)
Total Intended Award Amount: $450,000.00
Total Awarded Amount to Date: $450,000.00
Funds Obligated to Date: FY 2011 = $450,000.00
History of Investigator:
  • Leslie Kaelbling (Principal Investigator)
    lpk@csail.mit.edu
  • Tomas Lozano-Perez (Co-Principal Investigator)
Recipient Sponsored Research Office: Massachusetts Institute of Technology
77 MASSACHUSETTS AVE
CAMBRIDGE
MA  US  02139-4301
(617)253-1000
Sponsor Congressional District: 07
Primary Place of Performance: Massachusetts Institute of Technology
77 MASSACHUSETTS AVE
CAMBRIDGE
MA  US  02139-4301
Primary Place of Performance
Congressional District:
07
Unique Entity Identifier (UEI): E2NYLCDML6V1
Parent UEI: E2NYLCDML6V1
NSF Program(s): Robust Intelligence
Primary Program Source: 01001112DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 7923
Program Element Code(s): 749500
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

For a robot to operate in a complex environment over a period of hours or days, it must be able to plan actions involving large numbers of objects and long time horizons. Furthermore it must be able to plan and carry out actions in the presence of uncertainty, both in the outcome of its actions and in the actual state of the world. Thus, key challenges are hedging against bad outcomes, dealing with exogenous dynamics, performing efficient re-planning, and determining conditions for correctness and completeness.

This project will develop an approach to robot planning that addresses these challenges by integrating several key ideas: (1) Planning in belief space, that is, the space of probability distributions over the underlying state space, to enable a principled approach to planning in the presence of state uncertainty; (2) Planning with simplified models and re-planning as necessary to enable planning efficiently with outcome uncertainty while still enabling action choices based on looking ahead into likely outcomes; (3) Combining logical and geometric reasoning to enable detailed planning in large state spaces involving many objects; and (4) Hierarchical planning with interleaved execution to enable plans with very long time horizons by breaking up the planning problem into a sequence of smaller problems.

The methods developed will be tested in a system that combines planning, perception and execution for real physical robots navigating and manipulating objects in real, complex environments. The software developed in this project will be freely available as a collection of ROS (Robot Operating System) modules for easy porting to a wide variety of robots. The research in this project will contribute materials for two courses that the PIs are developing: (1) a lab-based introduction to electrical engineering and computer science based on mobile robots (currently taken by around 500 MIT students per year) and (2) a new project-based senior-level subject on robot planning and perception. All of the materials for these subjects will be available freely through MIT's OpenCourseWare site.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

Kaijen Hsiao and Leslie Pack Kaelbling and Tomas Lozano-Perez "Robust grasping under object pose uncertainty" Autonomous Robots , v.31 , 2011
Leslie Pack KaelblingTomas Lozano-Perez "Integrated Task and Motion Planning in Belief Space" International Journal of Robotics Research , v.32 , 2013 , p.1194

PROJECT OUTCOMES REPORT

Disclaimer

This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.

Robots that are highly adaptable and flexible have the potential to have a very broad impact on society, as household helpers, hospital assistants and aides to first responders.  Making that potential a reality will require robots that are substantially more capable of intelligent decision-making than existing robots.

Our overall goal is to develop the estimation, planning, and control techniques necessary to enable robots to perform robustly and intelligently in complex uncertain domains.  Robots operating in such domains have to deal explicitly with uncertainty.  Sensing is increasingly reliable, but inescapably local: robots cannot see, immediately, inside cupboards, under collapsed walls, or into nuclear containment vessels.  Task planning, whether in household or disaster-relief domains, requires explicit consideration of uncertainty and the selection of actions at both the task and motion levels to support gathering information.

In order to explicitly consider the effects of uncertainty and to generate actions that gain information, it is necessary to plan in belief space: that is, the space of the robot's beliefs about the state of its environment, which we will represent as probability distributions over states of the environment.  For planning purposes,the initial state is a belief state and the goal is a set of belief states: for example, a goal might be for the robot to believe with probability greater than 0.99 that all of the groceries are put away, or that there are no survivors remaining in the rubble. 

Planning in belief space beautifully integrates perception and action, both of which affect beliefs in ways that can be modeled and thus exploited to achieve an ultimate goal.  However, planning in belief space for realistic problems poses some substantial challenges: (a) belief spaceis generally a high-dimensional continuous space (of distributions) and (b) the outcomes of actions and (especially) perception makes the process dynamics highly non-deterministic.  

Our approach to robust behavior in uncertain domains is founded on the notion of integrating estimation, planning, and execution in a feedback loop.  A plan is made, based on the current belief state; the first step is executed; an observation is obtained; the belief stateis updated; the plan is recomputed, if necessary, etc.  We call this online replanning.  In contrast to the more typical method offinding a complete policy for all possible belief states in advance, this strategy allows planning to be efficient but approximate: it isimportant that the first step of the plan be useful, but the rest will be re-examined in light of the results of the first step.

A critical component of such a system is a planner that works effectively in very high-dimensional geometric problems that have substantial uncertainty:   robot trying to assemble ingredients for cooking a meal has to work in a space that is made up of the positions, orientations, and other aspects of a large number of objects; it will have localized uncertainty about some of the objects and may have very little information about others.  Planning for the robot is not just motion planning:  it must decide what order to move objects in, how to grasp them, where to place them, and soon.  It must also plan to gain information, including deciding whereto look, determining that it must move objects out of the way to get an unoccluded view, or selecting a cupboard to search for a particularobject it needs.

We have developed a hierarchical approach to solving such planning problems, which performs a temporal decomposition by planning operations at multiple levels of abstraction; this ensures that problems to be addressed by the planner are always reasonably small, making planning feasible.  We have used this planning method...

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page