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
0
votes
0 answers

What is the role of inconsistent state/set in ARA*?

I am reading the Anytime A* paper by Sebastian Thrun but I am having a hard time following "inconsistent states" Can someone ELI5 me why inconsistent states/set are important in the context of this algorithm?
sevebebe
  • 11
  • 2
0
votes
1 answer

About PDDL in AI planning

I am trying to solve a Pacman-style problem with a planner, using PDDL. I assume there are many food in the given map. I use exists to check if here is any other food in the map, but it does not work; why is that? Here is my problem file: (define …
yi li
  • 1
0
votes
2 answers

PDDL - Using numeric fluents using solver.planning.domains

I'm a noob at planning and I'm looking for help with numeric fluents. Here's a sample domain and problem that isn't working the way I think it should. Domain: (define (domain tequila) (:requirements :typing :fluents) (:types bottle ) …
0
votes
1 answer

How to check conditions in PDDL?

I am having to create PPDL, in which vehicles transport cargo across a map. A vehicle has a capacity in regards to how much cargo it can carry. Before a vehicle loads cargo onto it, it needs to know whether there is enough capacity for the vehicle…
LondonMassive
  • 275
  • 1
  • 12
0
votes
2 answers

Is User Input Possible in PDDL

I am using PDDL to define a path for a robot. The idea is that the robot should move 'x' no. of items from a room to outside the house . The variable "x" depends on the room. The robot should start from one room which the user tells has x no. of…
0
votes
2 answers

pddl precondtion not working correctly in the plan

I am working on a project in pddl. The idea is to pick four balls and transfer them to the conveyer. (defined in the goal) The simple pickup, move and drop actions work fine but when I try to make it more complicated for eg. by adding different…
0
votes
2 answers

How to model increase effects without knowing the exact amount of increase in PDDL?

I have a smart lamp which has the actions turn ON/OFF. The action turn on increases the brightness in the room, however, due to the current environment state I cannot definitely state how much it will increase the brightness. Is there a way to model…
Mahda
  • 1
0
votes
1 answer

Suggestions required in increasing utilization of yarn containers on our discovery cluster

Current Setup we have our 10 node discovery cluster. Each node of this cluster has 24 cores and 264 GB ram Keeping some memory and CPU aside for background processes, we are planning to use 240 GB memory. now, when it comes to container set up, as…
akash sharma
  • 309
  • 1
  • 15
0
votes
1 answer

Open-loop or Closed-loop (reactive) Path planning?

When we do path planning for collision avoidance, we can realize it open-loop or closed-loop. The open-loop method is to use an inherent simplified model, say, Bicycle model, for example, and propagate the system forward with an optimal input by…
0
votes
1 answer

How to apply dynamic programming to compute shortest path in graph?

I'm trying to compute the shortest path using dynamic programming in Python. I have all data properly stored as weighted segments (road) and nodes (cities) of a graph so this is not a problem as I was able to implement classical algorithms…
0
votes
1 answer

Compare cardinality of multiple sets and get specific value from member of greatest set

I am using clingo to solve flood-it problems. I use the predicate frontier([CELL], [COLOR], [TIMESTEP]) to keep track of all cells that are neighbors of the flood. The set of frontiers could look something like this: frontier(c(1,3),2,3)…
0
votes
1 answer

Create a moving marker. Robot Operating System (ROS)

I'm trying to plan routes in ROS using OSM data and show the results in Rviz, using Python. Until now, my result is the following one: Correct path computed by the algorithm shown in Rviz: Now, what I need is to create a marker or something that…
Ivan Sanchez
  • 69
  • 1
  • 4
0
votes
1 answer

Where to place my function? Into my native Gui or into my presenter?

I have the following scenario: I have Button and PreviewButton in Gui layer they have a common part named BasedButton. Button only knows IButtonPresenter, the interface of ButtonPresenter. The button should have no logic, the presenter could contain…
0
votes
1 answer

how to keep track of planning variable assignment in optaplanner

Is there a way to access planning variable's assignment during planning? In my use case, I want to assign a planning variable with certain status only one time only during planning. After that I don't want to use that planning variable. I know that…
mluser
  • 53
  • 1
  • 6
0
votes
1 answer

PDDL: Exact meaning of effects and conditions in durative-actions

In PDDL 2.1, durative-actions were introduced. They are described (amongst others) with conditons and effects. Both can be defined at start/at end, condition also over all. I found the following document, describing PDDL 2.1 quite extensively:…
franzlst
  • 115
  • 1
  • 7