Planning in KIDS.

Abstract

This report gives an overview of KIDS (Kestrel Interactive Development System). We describe a program derived with KIDS to solve the Missionaries and Cannibals problem (MC PROBLEM), a classical AI planning problem. Our interest in this problem arose as the result of some difficulties we experienced trying to use the AI planners O-Plan2 and SIPE-2 to solve it. We were curious as to how one could solve a planning problem such as the MC PROBLEM using KIDS. We also wanted to evaluate how difficult it would be for someone to formalize and derive a program with KIDS. We derived a program for the K-MC PROBLEM that would reach the solution for the 3-MC PROBLEM in 108 msecs (real time) and 0 msec (cpu time). For the same problem, on the same machine, SIPE-2 takes 26.l9 secs (real time) and 0.15 secs (cpu time). We were able to get the solution for 100 problems, the K-MC PROBLEM (k=1,2,. . .100), in 225.009 secs (real time) and 11.467 secs (cpu time) using KIDS. SIPE-2 could not solve problems for k > 45 in less than 20 minutes real time. (AN)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1995
Accession Number
ADA303390

Entities

People

  • Carla Gomes

Organizations

  • Calspan-University of Buffalo Research Center

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Algorithms
  • Artificial Intelligence
  • Command And Control
  • Computational Science
  • Computer Programming
  • Computer Science
  • Engineering
  • Formal Languages
  • Language
  • Operations Research
  • Optimization
  • Programming Languages
  • Search Theory
  • Software Development
  • Trees (Data Structures)

Readers

  • Artificial Intelligence
  • Mathematics or Statistics