AI Planning Task
(Redirected from Machine Planning Task)
		
		
		
		Jump to navigation
		Jump to search
		An AI Planning Task is a problem solving task that requires an AI planning system to generate action sequences for achieving goal states.
- AKA: Automated Planning Task, Artificial Intelligence Planning Task, Machine Planning Task.
 - Context:
- Task Input: Initial State, Goal State, Domain Model
 - Task Output: Action Plan, Execution Sequence
 - Task Performance Measure: plan quality, planning time, solution optimality
 - ...
 - It can typically process Planning Domain Description through planning language parsers.
 - It can typically search State Space via planning search algorithms.
 - It can typically evaluate Plan Validity using planning constraint checkers.
 - It can typically optimize Plan Quality through planning optimization methods.
 - It can typically handle Planning Uncertainty with planning robustness techniques.
 - ...
 - It can often employ Heuristic Search for planning efficiency improvement.
 - It can often utilize Domain Knowledge for planning guidance.
 - It can often support Replanning through planning adaptation mechanisms.
 - It can often enable Hierarchical Planning via planning abstraction levels.
 - It can often incorporate Temporal Reasoning for planning time management.
 - ...
 - It can range from being a Classical AI Planning Task to being a Non-Classical AI Planning Task, depending on its planning assumption.
 - It can range from being a Deterministic AI Planning Task to being a Probabilistic AI Planning Task, depending on its planning uncertainty model.
 - It can range from being an Offline AI Planning Task to being an Online AI Planning Task, depending on its planning execution mode.
 - It can range from being a Single-Agent AI Planning Task to being a Multi-Agent AI Planning Task, depending on its planning coordination requirement.
 - It can range from being a Domain-Independent AI Planning Task to being a Domain-Specific AI Planning Task, depending on its planning knowledge requirement.
 - ...
 - It can be solved by AI Planning System through planning algorithm implementation.
 - It can be specified in Planning Domain Definition Language for planning problem representation.
 - It can be evaluated by Planning Benchmark for planning performance assessment.
 - It can be decomposed into Planning Subtask for planning complexity management.
 - It can be integrated with Execution Monitoring for planning robustness.
 - ...
 
 - Example(s):
- Classical Planning Tasks, such as:
 - Temporal Planning Tasks, such as:
 - Probabilistic Planning Tasks, such as:
 - Multi-Agent Planning Tasks, such as:
 - ...
 
 - Counter-Example(s):
- Reactive Control Tasks, which respond without planning lookahead.
 - Classification Tasks, which categorize without action sequence generation.
 - Optimization Tasks, which find optimal values without plan construction.
 
 - See: Problem Solving Task, Constraint Satisfaction Task, Search Task, Optimization Task, Decision Making Task, Scheduling Task, AI Planning System, Planning Domain Definition Language, Automated Planning, Cognitive Task.