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

Marker Interfaces for storing different objects in Java Collections

I'm implementing a Linear Planner with a stack of goals in Java. For that reason I'm using a Stack in which I need to store different objects: predicates, operators, states. To achieve this, I created an Interface called Stackable, so I have a…
3
votes
1 answer

Is it possible to get multiple plans from a PDDL implementation?

I'm trying to write a program which can solve a maze in PDDL, for example by using graphplan. From the examples I have seen on the internet one gets A solution to the problem(e.g. PDDL Graphplan can't find plan), but only one. I have some specific…
Nekroz
  • 169
  • 1
  • 1
  • 11
3
votes
2 answers

C# and SWI-Prolog - Turn a List of characters into a List of facts

So, I am developing a game with Unity3D, and I'm using Prolog for IA planning. My problem is very similar to the monkey and banana problem, but I'm having problems on asserting a new initial state. By changing the initial state, my character would…
thiago araujo
  • 65
  • 3
  • 5
2
votes
0 answers

Obtaining and Parsing Map Street Data in Python

How would you obtain a graph describing street interconnections and estimated driving times, and parse it using Python? As an exercise, I'm trying to implement a basic A* planner to plot a route for navigating between two points on a map (i.e.…
Cerin
  • 60,957
  • 96
  • 316
  • 522
2
votes
1 answer

Why isn't PDDL compiling correctly and resulting in parse error?

I am new to PDDL so I don't understand very well what's going on but I have this issue and it seems that black-box planner isn't able to parse my PDDL code. Here there is the domain: (define (domain vacuum) (:requirements :strips) …
Neskelogth
  • 91
  • 3
  • 12
2
votes
1 answer

PDDL planner for Sokoban, Challenge

I was experimenting a bit with generation of Sokoban levels in PDDL and found out that many levels in Sokoban, which appear easy to humans, seem to be quite hard for PDDL planners (to be honest I also found vice versa examples). So I wonder whether…
bo198214
  • 178
  • 1
  • 4
2
votes
1 answer

A bug in PDDL AI Planning

I am trying to solve a Pacman problem using PDDL. The main thing I need to do is soft code the power duration without using functions or fluents. It returns no error but somehow I feel like it inits Powerlose(n2, n0). I never init Powerlose(n2, n0)…
Dan
  • 103
  • 7
2
votes
1 answer

Is squared Euclidien distance a admissible heuristic?

I have a grid such as shown in the picture. So far I have implemented below functions as my heuristic functions. So the goal of this game is to collect all the numbers placed on this grid. Starting point A. Manhattan distance and then take the…
2
votes
1 answer

variable in PDDL that can be of more than one type?

Is there any version of this statement that is valid, expressing that an actor knows another actor or a location? Or must I specify separate predicates knows_actor and knows_location? (:predicates (knows ?a - ACTOR ?thing - ACTOR…
davideps
  • 541
  • 3
  • 13
2
votes
1 answer

Prolog planning using retract and assert

I wonder, is it possible to do planning in Prolog using the knowledge base modified by retract and assert during the runtime? My idea is as follows: assume that I need to replace a flat tire of a car. I can either put something on the ground or move…
karlosss
  • 2,816
  • 7
  • 26
  • 42
2
votes
2 answers

Automated planning: what makes "blocksworld" a non trivial problem?

Blocksworld is apparently a benchmark domain in automated planning. This domain consists of a set of blocks, a table and a robot hand. The blocks can be on top of other blocks or on the table; a block that has nothing on it is clear; and the robot…
Atte Juvonen
  • 4,922
  • 7
  • 46
  • 89
2
votes
2 answers

Hierarchical Task Network (HTN) in AI

I cannot get my head around what HTN is. What I believe is that we want to decompose all the small actions of a plan into a higher level plan. For example: "Take bus" is an HLA of i.e. "go to bus", "buy ticket", "sit down" etc. Am I wrong? Would…
user8997599
2
votes
3 answers

Planning with Rule Engines

Can i use Rule Engines for solving a job scheduling problem (JSS)? I want to have something like this. Is this possible with rule engines or not a good idea.
2
votes
0 answers

Trying to implement potential field navigation in matplotlib

I am trying to produce an algorithm where multiple agents (blue) work together as a team to capture a slightly faster enemy agent (red) by preforming surrounding and circling tactics in a 2D grid. So I am trying to make a robust multi-agent…
user3377126
  • 2,091
  • 4
  • 32
  • 39
2
votes
2 answers

Model Checking For Numbers Lite Game

I am going through the model checking methods and I want to use the techniques in order to solve a game called Numbers Paranoia lite as a planning problem. Given an MxN, (MxN > 8), matrix in which each plate is either Problem Image - empty -…
user6133527
1
2
3
9 10