Results 11 - 20
of
183
Controlling a Nonlinear Hierarchical Planner Using Case Replay
- In Proceedings of the 1994 European Workshop on Case-Based Reasoning
, 1994
"... . We describe a hybrid case-based reasoning system supporting process planning for machining workpieces. It integrates specialized domain dependent reasoners, a feature-based CAD system and domain independent planning. The overall architecture is built on top of CAPlan, a partial-order nonlinear pla ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
. We describe a hybrid case-based reasoning system supporting process planning for machining workpieces. It integrates specialized domain dependent reasoners, a feature-based CAD system and domain independent planning. The overall architecture is built on top of CAPlan, a partial-order nonlinear
unknown title
"... Work-in-progress on the design of a conditional nonlinear planner is described. CNLP is a nonlinear planner that develops plans that account for foreseen uncertainties. CNLP represents an extension of the conditional planning technique of Warren [75] to the domain of nonlinear planning. 1 ..."
Abstract
- Add to MetaCart
Work-in-progress on the design of a conditional nonlinear planner is described. CNLP is a nonlinear planner that develops plans that account for foreseen uncertainties. CNLP represents an extension of the conditional planning technique of Warren [75] to the domain of nonlinear planning. 1
An Efficient Reactive Planner for Synthesizing Reactive Plans
- In Proceedings of AAAI-91
, 1991
"... We present a nonlinear forward-search method suitable for planning the reactions of an agent operating in a highly unpredictable environment. We show that this method is more efficient than existing linear methods. We then introduce the notion of safety and liveness rules. This makes possible a shar ..."
Abstract
-
Cited by 37 (5 self)
- Add to MetaCart
We present a nonlinear forward-search method suitable for planning the reactions of an agent operating in a highly unpredictable environment. We show that this method is more efficient than existing linear methods. We then introduce the notion of safety and liveness rules. This makes possible a
A Java planner for Blocksworld problems
, 2004
"... Intelligent strategies are indispensable for solving problems arising daily in life. Knowledge-based intelligent strategies are required to solve such problems efficiently and to obtain the desired result. This is e.g. achieved by finding a sequence of actions that lead from the initial state to the ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
of problem solving and (linear-) total-order state-based planning. Additionally, this work is based on a non-linear Java planner that implements the essential parts mentioned above using the Blocksworld domain and Blocksworld problems.
Machine learning in hybrid hierarchical and partial-order planners for manufacturing domains
- Applied Artificial Intelligence
, 2005
"... systems is being widely deployed for all the tasks involved in the process, from product design to production planning and control. One of these problems is the automatic generation of control sequences for the entire manufacturing system in such a way that final plans can be directly used as the se ..."
Abstract
-
Cited by 5 (4 self)
- Add to MetaCart
as the sequential control programs which drive the operation of manufacturing systems. Hybis is a hierarchical and nonlinear planner whose goal is to obtain partially ordered plans at such a level of detail that they can be used as sequential control programs for manufacturing systems. Currently, those sequential
Partial-Order Planning: Evaluating Possible Efficiency Gains
- Artificial Intelligence
, 1994
"... Although most people believe that planners that delay step-ordering decisions as long as possible are more efficient than those that manipulate totally ordered sequences of actions, this intuition has received little formal justification or empirical validation. In this paper we do both, characteriz ..."
Abstract
-
Cited by 74 (1 self)
- Add to MetaCart
, characterizing the types of domains that offer performance differentiation and the features that distinguish the relative overhead of three planning algorithms. As expected, the partial-order (nonlinear) planner often has an advantage when confronted with problems in which the specific order of the plan steps
Towards a theory of conflict detection and resolution in nonlinear plans
- in Nonlinear Plans In Proceedings of 11th IJCAI
, 1989
"... This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution that subsumes conflict handling in classical nonlinear planners. By relaxing the restrictions, we develop a more general ..."
Abstract
-
Cited by 15 (0 self)
- Add to MetaCart
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution that subsumes conflict handling in classical nonlinear planners. By relaxing the restrictions, we develop a more
A mode-switching path planner for UAV-assisted search and rescue
, 2005
"... Abstract — Unmanned aerial vehicles (UAVs) can assist in U.S. Coast Guard maritime search and rescue missions by flying in formation with a manned helicopter while using infrared cameras to search the water for targets. Current search and rescue flight patterns contain abrupt turns that can be achie ..."
Abstract
-
Cited by 14 (0 self)
- Add to MetaCart
series of k corners, the along-track distance between the vehicles is defined as L(k). By representing the path planner as a finite automaton, it is shown that any execution of the system causes the series {L(k)} to converge to zero, thereby resulting in satisfactory tracking. Simulations were performed
A robocentric motion planner for dynamic environments using the velocity space
- IEEE Int. Conf. On Intelligent Robots and Systems
, 2006
"... Abstract — This paper addresses a method to optimize the robot motion planning in dynamic environments, avoiding the moving and static obstacles while the robot drives towards the goal. The method maps the dynamic environment into a model in the velocity space, computing the times to potential colli ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
collision and potential escape and the associated robot velocities. The problem of finding a trajectory to the goal is stated as a constrained nonlinear optimization problem. The initial seed trajectory for the optimization is directly generated in the velocity space using the model built. The method
Contact-aware nonlinear control of dynamic characters
- ACM Transactions on Graphics (Proc. SIGGRAPH
, 2009
"... Dynamically simulated characters are difficult to control because they are underactuated—they have no direct control over their global position and orientation. In order to succeed, control policies must look ahead to determine stabilizing actions, but such planning is complicated by frequent ground ..."
Abstract
-
Cited by 48 (7 self)
- Add to MetaCart
ground contacts that produce a discontinuous search space. This paper introduces a locomotion system that generates high-quality animation of agile movements using nonlinear controllers that plan through such contact changes. We demonstrate the general applicability of this approach by emulating walking
Results 11 - 20
of
183