Stack Overflow
Stack Overflow

Questions tagged [planning]

A branch of artificial intelligence concerned with generating multi-part solutions to problems. Examples include game-playing AI, industrial automation, turn-by-turn directions

Automated planning and scheduling is the sub-field of artificial intelligence concerned with generating multi-part solutions to problems.

Some familiar examples of planning algorithms and systems include:

  • The "Minimax" algorithm for choosing the best move in a two-player game (such as Tic-Tac-Toe, or Chess)
  • The "A*" algorithm for heuristic search
  • GPS navigation software, providing turn-by-turn driving directions
  • Unmanned aerial vehicles ("drones") perform automatic corrections to stay on course despite changes in wind or other disruptions

Commonly used University textbooks on the subject:

139 questions
0
votes
1 answer

Forward Planning Heuristic- How to calculate hmax and hadd?

I am trying to understand the concept of the forward planning heuristics hmax and hadd. I've found some resources online, but I really can't understand how to calculate the value of hmax and hadd? Here the resources I am referring…
Rao208
  • 147
  • 1
  • 3
  • 15
0
votes
1 answer

Fast Downward planner

I am currently studying the AI fast downward planner, and I would like some help in this area. I know that the planner receives a domain.pddl file and a problem.pddl file, in addition, it receives a search algorithm and a heuristic function. Many…
fiscsp
  • 37
  • 1
  • 4
0
votes
1 answer

How to create/post and delete/unpost constraints during search in Choco

I have got a project in Choco solver, but I have a question about the external effects during the search. I have got a planning graph with (let's say) BoolVars organised in layers and durations assigned to the layers, which mean that some action…
Eramol
  • 33
  • 7
0
votes
1 answer

Optaplanner passing a variable through planning solution

I have a planning entity Request and a planning variable as taxi. I want to pass the Date(a particular day) to the drools file for cab allocation. I tried adding Date to the planning solution but the rule always failed where i captured the…
Sabyasachi Sahoo
  • 3
  • 1
  • 4
0
votes
1 answer

Planning n jobs on m Machines with Linear Programming

I heard that you can use Linear Programming for planning problems. I dont really understand how to do that because Linear Programming is optimal and planning in large scale (for example planning n jobs on m machines) has exponential difficulty. So…
MrWoffle
  • 149
  • 2
  • 10
0
votes
3 answers

Find ALL paths in a grid between 2 nodes

I'm trying to find all the paths between 2 nodes in a grid, and the path has to go through all the node from start to end. Example (Start = S, End = E) 0 0 0 0 S 0 0 0 E The answer for the above is 2 paths: (ignore the '.''s) 0-0-0 |.......| 0…
GK12
  • 1
  • 1
0
votes
1 answer

Two room planner Blocks world Prolog

I need some very basic help on how to approach this problem. I have a one room planner that, given a start state and end state, it solves this using recursion. However, I want to solve this for two states (aka rooms). I decided that setting flags…
heyblackduck
  • 117
  • 13
0
votes
1 answer

Hierarchical Task Network Planner in Python

Is anyone aware of a hierarchical task network planner implemented in Python or Java? I've found a few open source systems, but they're all seemingly dead projects and haven't been maintained in years.
Cerin
  • 60,957
  • 96
  • 316
  • 522
0
votes
1 answer

Difference between Planning Reasoning and Constraint Solving

I'm new to this topic I'm currently sligtly confused about the differences between planning, constraint solving, and reasoning As far I understood planning is the identification of the right "things" to do. This can be done by following some…
Matthias Goldhoorn
  • 220
  • 1
  • 10
0
votes
1 answer

PDDL Graphplan can't find plan

I've written a domain and a test problem in PDDL, but apparently the graphplan implementation can't find a plan. Here's the domain: (define (domain aperture) (:requirements :strips :typing :negative-preconditions) (:types cube …
C. Porto
  • 631
  • 3
  • 12
  • 26
0
votes
1 answer

Handling looping actions in STRIPS planning

How can I modify STRIPS such that it avoids going in loops or repeating actions? Let's say we have A - B - C - D - E as the areas (traversing problem), they are all bidirectional. Initial state is we are At(A) and the goal is we need to be At(E).…
Zik
  • 1,556
  • 7
  • 22
  • 31
0
votes
2 answers

fast forward and pddl: is the computed solution the best?

how can i be sure that the plan, computed by the fast forward planner, is the best of all the possible plans?! Does exist an automatic tool to solve this problem?! thanks a lot!
Bau Miao
  • 173
  • 6
0
votes
1 answer

Prolog planner only generates one plan

I have a prolog planner which works correctly with one major problem of only generating one plan at the time. The plan is correct but for my application I really need to have all the possible plans. plan(State, Goal, _, Moves) :- …
bamboo10
  • 133
  • 2
  • 14
0
votes
2 answers

How to write kind of Conditional Planning in Prolog?

I tried to write a prolog code that can understand student program written in C#. Now I'm stuck in the process of recognizing the 'if' statement in student's program. For example: The following is the code that I expect from the student. int d =…
Budi Hartanto
  • 337
  • 3
  • 14
-1
votes
3 answers

Multiple products supported by small development team

I manage a team with seven developers with more than ten products and 20 integrations between products. I took over the team a year ago, and we have worked hard to spread knowledge across the team. A year ago, every developer was basically a silo…
Henrik Riis
  • 9
  • 1
1 2 3
…
9
10