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:

109 questions
1
vote
2 answers

Manhattan distance generalization

For a research I'm working on I'm trying to find a satisfying heuristic that is based on Manhattan distance which can work with any problem and domain as an input. Which is also known as domain-independent heuristic. For now, I know how to apply…
1
vote
0 answers

Planning algorithms in WSN

I'm looking for some planning algorithms that i can use to collect informations from sensor nodes in WSN. I found Dijkstra Algorithm but the problem with it is that it can't go through all the given nodes. I need 3 algorithms for my test.
1
vote
1 answer

How to store mathematical values in PDDL?

I need to create a plan in PDDL to visit a subset of n places, each of which has a score. I need to maximize the utility, which is defined as the sum of each individual score. How do I represent this domain in PDDL? Specifically, how do I store…
1
vote
0 answers

Time and memory limits as parameters in Metric-FF

When running Metric-FF, it does not appear any time or memory limitations as possible input parameters. My question is, is it possible to introduce them as input parameters when running the planner? The cited planner is the following…
Alvaro Gomez
  • 320
  • 2
  • 4
  • 21
1
vote
2 answers

Could I use heuristic to get the result in the playout phase in Monte Carlo Search Tree?

From my understanding, the goal of playout or simulation stage in MCTS is to obtain a result and award or punish the nodes on the path from root during backpropagation. (Please correct me if I am wrong) My question is if I can use domain knowledge…
1
vote
3 answers

Aggregating Probabilistic Plans

I'm trying to create a simple STRIPS-based planner. I've completed the basic functionality to compute separate probabilistic plans that will reach a goal, but now I'm trying to determine how to aggregate these plans based on their initial action, to…
Cerin
  • 50,711
  • 81
  • 269
  • 459
1
vote
1 answer

can't find the solution for robot path finding

I'm new to the pddl. I need to find solution where a robot can put different objects in different destination cells. I'm using the software from http://www.fast-downward.org/. However, The problem is that my actions can't find the solution as…
1
vote
0 answers

Gene representation for production planning with constraints

I'm trying to improve the throughput of a production system. The exact type of the system isn't relevant (I think). Description The system consists of a LINE of stations (numbered 1, 2, 3...) and an ARM. The system receives an ITEM at random…
Ng Oon-Ee
  • 1,000
  • 7
  • 23
1
vote
1 answer

Can someone explain this STRIPS forward planning pseudo code for me?

Input : Set of operators 0, Start state s, Goal state g Output : Plan P 1. begin 2. | let P = []; 3. | while g (is not a subset of) s do 4. | | let E = {a|a is ground instance of an operator in O, 5. | | and Preconditions(a) hold in s} 6. …
toastedDeli
  • 553
  • 5
  • 24
1
vote
1 answer

STRIPS representation of monkey in the lab

I have been reviewing some material on the representation of an AI plan given the STRIPS format, and found that different people seem to formulate the same problem in different ways. For instance, Wikipedia has an example regarding the Monkey in the…
Stevo
  • 399
  • 5
  • 24
1
vote
1 answer

What are the differences between action and motion planning?

I having hard time to understand the differences between action and motion planning. Does motion planning only involve finding trajectories for mobile agents?
hevele
  • 803
  • 5
  • 18
  • 37
1
vote
1 answer

Having a "out of global stack" in prolog

Hey guys I have a fairly simple question about Prolog. %on(Block,Object). %…
1
vote
2 answers

Determining the optimally scoring move on a probabilistically represented 2D grid in real time

I'm posting this to StackOverflow, cstheory.stackexchange.com, and math.stackexchange.com because I'm not really sure where it fits best. I hope that's OK. I have a 2D grid (size varies per map, ranging from 10X10 thru 20X20, necessarily square)…
Melissa
  • 21
  • 1
1
vote
0 answers

Comparing plans

I have a project that is intended to check the correctness of the student program. I currently use an approach like this: I specify a goal that the student program must achieve. I change the student program into a sequence of facts and actions (in…
Budi Hartanto
  • 347
  • 3
  • 14
1
vote
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
  • 347
  • 3
  • 14