Oral Presentations

Poster or Presentation Title

Machine Planning with Nexus States

Student Author Information

Sean Novak, University of LynchburgFollow

Location

Schewel 232

Access Type

Open Access

Presentation Type

Oral Presentation

Start Date

6-4-2022 3:30 PM

End Date

6-4-2022 3:45 PM

Department

Computer Science

Abstract

General-purpose machine planning is intractable, but if we are willing to extra steps in our resulting plans, it's possible to simplify planning to polynomial time. For example, routing packages can be simplified with the use of transportation hubs, as are used in real life by airlines and shipping companies. Work for finding rules to use those hubs is discussed.

Faculty Mentor(s)

Dr. Will Briggs

Rights Statement

The right to download or print any portion of this material is granted by the copyright owner only for personal or educational use. The author/creator retains all proprietary rights, including copyright ownership. Any editing, other reproduction or other use of this material by any means requires the express written permission of the copyright owner. Except as provided above, or for any other use that is allowed by fair use (Title 17, §107 U.S.C.), you may not reproduce, republish, post, transmit or distribute any material from this web site in any physical or digital form without the permission of the copyright owner of the material.

This document is currently not available here.

Share

COinS
 
Apr 6th, 3:30 PM Apr 6th, 3:45 PM

Machine Planning with Nexus States

Schewel 232

General-purpose machine planning is intractable, but if we are willing to extra steps in our resulting plans, it's possible to simplify planning to polynomial time. For example, routing packages can be simplified with the use of transportation hubs, as are used in real life by airlines and shipping companies. Work for finding rules to use those hubs is discussed.