Recent Changes - Search:

Research

Notes

Architecture

Faults

System

Planning

Background

OS

Misc

edit SideBar

GeneralPlanning

Now if gets real.

This is a huge area of research. How am I going to write intelligently about it here? How much of it is actually relevant?

Copy and paste crap:

By Proof

Graphplan Huzzah! A description of Graphplan.

  • A.L. Blum and M.L. Furst. Fast Planning Through Planning Graph Analysis* 1. Artificial intelligence, 90(1-2):281-300, 1997.
  • S. Kambhampati, E. Parker, and E. Lambrecht. Understanding and Extending Graphplan. Recent Advances in AI Planning, pages 260-272, 1997.

SAT Plan

Planning for Multiple Agents

When planning must be done to coordinate multiple robots to work together, a whole new set of problems arise. While one could used an algorithm designed for a single agent by treating the separate agents as one giant agent with added restrictions to avoid collisions and such, this causes the solution space to grow rapidly and is cumbersome. Specific multi-agent algorithms are designed to solve these problems.

Bekris Work

Edit - History - Print - Recent Changes - Search
Page last modified on August 25, 2013, at 12:59 PM