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

PDDL for Warehouse

I am trying to model a warehouse domain in PDDL and I am facing some difficulties in defining the problem file. The domain consists of trucks that can move between several locations, with packages and crates located in each location. A truck can…
Naive
  • 1
  • 2
0
votes
0 answers

LPG planner: how to increase the MAX_RELEVANT_ FACTS?

I'm new in using LPG planner. I'm trying to find a plan using pddl 2.2 for domain with many derived-predicates and problem with many initial "conditions". The LPG planner starts running but at some point it can't find a plan, so it can do two…
0
votes
0 answers

Return path - Bug Algorithms

I am trying to develop a simple algorithm in a MBSE tool to obtain a path between a start and an end points. Here a summary: Example I have all informations regarding the start and end point, as well as I know everything for each polygon points (x…
0
votes
0 answers

Pyperplan with action costs support or alternative wanted

I'm using pyperplan in my project, however I'm very limited in choice of planning domains, as pyperplan does not support PDDL v2 Do you know of any pyperplan fork, that has this functionality? Basic +1 action costs should be enough, they are my only…
0
votes
1 answer

Domain modeling help / optaplanner viability (Optaplanner)

I was hoping to attempt creating a bot to automatically play a video game, and was wondering if Optaplanner could be used for task planning for the bot. The bot has a starting state, desired end state, and different tasks it can perform. The goal…
es1ph
  • 1
  • 1
0
votes
1 answer

Check if the story points changed in Azure DevOps Boards

My goal is to check which, if any, stories had the story point field changed and the values, from old value to new value. In Queries you can only check the current value for story point, although if you change the story point you can see that in the…
0
votes
0 answers

Heuristic Search Upper Bound

I have the following question in my midterm review: Suppose that you were planning to run A* on a unit-cost domain (ie. where all actions have a cost of 1), with a heuristic function that only returned non- negative integer values. Further, assume…
A. Boy
  • 47
  • 1
  • 5
0
votes
0 answers

algorithm to split planning path from n gps points

I currently have a final project on building a ground control station for a lakebed topographic survey vessel. I want to build an algorithm to divide (grid) n Gps points into planning paths like the image above. I got it from Measure Ground…
0
votes
1 answer

PDDL - invalid predicates and correct usage of forall

I am new to pddl planning and now I am trying to create a domain and problem file as an exercise. Short domain description: I have a couple of cars which can be taken and put at places A and B. The task is simple: take all the cars from place A and…
teoML
  • 784
  • 4
  • 13
0
votes
2 answers

Q: PDDL doesn't compile problem and domain

I don't know why it doesn't work. here is my code: Domain (define (domain tren_mover) (:requirements :adl) (:predicates (conectado ?x ?y) (en ?x ?y) (movil ?x) ) (:action mover :parameters (?tren ?origen…
Paula
  • 1
  • 1
0
votes
0 answers

frog puzzle using strips and pddl

I've been trying to formalizing a domain and preparing two instances for a puzzle in which a frog is located in an n × n land, with few obstacles and a lot of insects. The frog can jump in any length in four cardinal directions and cannot land on…
0
votes
2 answers

Why does the final score of Partition Search drop badly

I am new to Optaplanner. I'm trying to achieve a good score through the partitioning strategy. This is my very basic solver configuration: com.my.package.SolutionClass
0
votes
1 answer

Implementation of partitioned search without defining a xml configuration with OptaPlanner

I am trying to implement a partition search for my problem. I managed to define and implement the SolutionPartitioner interface and the splitWorkingSolution method. From what I understand, the partitioned search phase has to be followed by a local…
0
votes
1 answer

Are there available temporal planners that work properly on Linux?

I've been searching the web for a planner that supports temporal planning, specifically compatible with PDDL 2.2. My machine runs Ubuntu bionic (18.04). I was trying to use LPG-td planner, which strangely interpreted the planning problem as…
roym18
  • 23
  • 4
0
votes
1 answer

PDDL task help. Error message. Syntax error

I have this task: 16 compartments containing 3 red and 3 black balls are given as shown in the figure below. Rearrange the balls so that the three red balls next to each other are directly followed by the black balls! Two adjacent balls can be…
Rox
  • 1