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
1
vote
1 answer

IBM TM1 (Planning Analytics) - Cube view to Datagrid in C#

I'm working to get a Cube View to my Datagrid in C#, I setup the login and everything around, now I mess up with the Cubeview and Values. I tried to…
1
vote
0 answers

Similar like world blocks in prolog with new rules

I will go on a trip and take my pets, I have 3 animals (dog, cat, rat), but they don't get along very well. I can only take 1 animal at a time, but I can't leave the dog with the cat or the cat with the hamster alone because they would literally eat…
J.A.M.G.
  • 11
  • 2
1
vote
2 answers

PDDL2.1: Purpose of `over all`

I'm working with PDDL2.1 durative-actions and I'm having difficulty understanding the purpose of over all. I have a function charge_level which is updated with a value every 10Hz. In a durative-action move, I say condition: (over all (>=…
mger
  • 61
  • 7
1
vote
1 answer

PDDL Durative-Action: Flexible duration

I'm implementing a charging action in PDDL2.1 that is based off a function (charge_level). The function value for (charge_level) works and updates ~10Hz. I want to create an action called charge which continues until the charge_level reaches a…
mger
  • 61
  • 7
1
vote
0 answers

Hard constraints are not solving in Optaplanner task assignment

I am using the Optaplanner Task Assignment solver to assign 68 tasks of 37 customers to 5 employees. Hard constraints are as follows - Tasks have to be completed in 6 days. Only one task of a Customer can be completed in one day. A task has to be…
1
vote
1 answer

How to write PDDL Domain and Problem file?

I am trying to do some planing project by using PDDL. I want to do from some natural text. Like: Take the knife from left to right hand. Cut the apple. Wash knife. I am confused abut the predicates and action. how to defined the predicates?
jonson
  • 105
  • 2
  • 7
1
vote
1 answer

z3 planning problems and blocks world

I am interested in using z3 for solving planning problems but I am having difficulty finding examples. For instance I really want to find an example of the Sussman anomaly/blocks world in z3 but have not been able to find anything. My attempt looks…
skyfire
  • 227
  • 1
  • 6
1
vote
0 answers

PostgreSQL 11 higher Planning time on Partitioned table

I am looking to Range Partition one of my table (i.e. TransactionLog) in PostgreSQL 11. While evaluating query performance between the un-partitioned and partitioned table I am getting huge difference in planning time. Planning time is very high in…
Ravi Garg
  • 13
  • 3
1
vote
1 answer

Forall statement applied for a subset of elements in PDDL Domain?

Case of use First of all, I want to explain my case of use: I want to divide a field in different sectors and all plants should be analyzed by robots (just one robot per sector). I want to check in :preconditions that all plants for one sector are…
Alvaro Luis
  • 13
  • 1
  • 4
1
vote
1 answer

How to obtain the causal graph of a problem in pddl using fast downward

How can I get the causal graph of a problem when I have the PDDL of the domain and the PDDL of the problem, using fast downward?
Xtalker
  • 11
  • 3
1
vote
1 answer

Prolog Permutations scheduling

I have the following file with the predicate attends which symbolizes that every student attends a certain course (the first argument : Student_ID, the second argument : Course_ID). attends(476, c216). attends(478, c216). attends(484,…
DIMITRIOS
  • 305
  • 1
  • 3
  • 10
1
vote
1 answer

What's the difference between Link and Path in PDDL?

In the driverlog domain in PDDL we have specified links and paths. (define (domain driverlog) (:requirements :typing) (:types location locatable - object driver truck obj - locatable ) (:predicates (at ?obj -…
1
vote
1 answer

Regressive Goal Oriented Action Planning

I am currently trying to regressively search from a goal state to find out a list of actions that will achieve the goal state for my GOAP planner. So far, the pseudocode for what I have down goes like this: closedList = list; s =…
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…
Sam Radhakrishnan
  • 681
  • 1
  • 5
  • 19