1 / 3

R10

R9. R10. Start. Start. R1. R2. R5. R6. R3. R4. R7. R8. Black Tape. Yellow Tape. Schedule a Meeting. Robot starts from one of the two ‘Start’ nodes Room are numbered from 1 to 10 Input (or parameters) a sequence of room numbers such as [1,2,5], [1,4], or [5,3,7,9]; and

nora-white
Download Presentation

R10

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. R9 R10 Start Start R1 R2 R5 R6 R3 R4 R7 R8 Black Tape Yellow Tape

  2. Schedule a Meeting • Robot starts from one of the two ‘Start’ nodes • Room are numbered from 1 to 10 • Input (or parameters) • a sequence of room numbers such as [1,2,5], [1,4], or [5,3,7,9]; and • a number indicates its start position, i.e., 9 or 10 • Robot needs to travel to all the room in the list and finishes at where it starts.

  3. Requirements • Provide a situation calculus theory that describes the domain. • Develop IndiGolog program(s) that can achieve the goal. • Implement the IndiGolog program in Legolog with exogenous actions for • deleting some of the destinations • adding some of the destinations

More Related