PLANNING MULTI-STEP ERROR-DETECTION AND RECOVERY STRATEGIES

Robots must plan and execute tasks in the presence of uncer tainty. Uncertainty arises from sensing errors, control errors, and the geometry of the environment. By employing a com bined strategy offorce and position control, a robot program mer can often guarantee reaching the desired final configura tion from all the likely initial configurations. Such motion strategies permit robots to carry out tasks in the presence of significant uncertainty. However, compliant motion strategies are very difficult for humans to specify. For this reason we have been working on the automatic synthesis of motion strategies for robots. In previous work (Donald 1988b; 1989), we presented a framework for computing one-step motion strategies that are guaranteed to succeed in the presence of all three kinds of uncertainty. The motion strategies comprise sensor-based gross motions, compliant motions, and simple pushing motions. However, it is not always possible to find plans that are guaranteed to succeed. For example, if tolerancing errors render an assembly infeasible, the plan executor should stop and signal failure. In such cases the insistence on guaranteed success is too restrictive. For this reason we investigate error detection and recovery (EDR) strategies. EDR plans will succeed or fail recognizably: in these more general strategies, there is no possibility that the plan will fail without the exec utor realizing it. The EDR framework fills a gap when guar anteed plans cannot be found or do not exist; it provides a technology for constructing plans that might work, but fail in a “reasonable” way when they cannot. We describe techniques for planning multi-step EDR strat egies in the presence of uncertainty. Multi-step strategies are considerably more difficult to generate, and we introduce three approaches for their synthesis: these are the Push-for ward Algorithm, Failure Mode Analysis, and the Weak EDR Theory. We have implemented the theory in the form of a planner, called LIMITED, in the domain ofplanar assemblies. © 1990, Sage Publications. All rights reserved.