For the initial part of the task ("get from the front doors to the area of the registration desk"), Grace has no a priori information, relying on the directions given by the human it interacts with. After Grace has registered and been "given" a map, she uses a map built the night before to navigate to the location where she's to give her talk. The map, however, only includes the static environment; the navigation & localization software must deal with dynamic obstacles (such as the crowds surrounding the robot).
Re:Does GRACE connect to internet?
on
Social Robot?
·
· Score: 5, Interesting
Actually, that is planned for the future. We currently have the ability to locate the AAAI badges that are given to all conference attendees and use OCR to extract the name of the person we're talking to (Swarthmore did that portion of the work). Next year, we'd like to try to schmooze with conference attendees about their current research by pulling down their current papers, c.v.'s, etc. off the web. In time, in time.:)
There have been efforts to blend mathematical algorithm provers with programming tools. Perhaps someone will succeed with something general enough to be able to review existing code.
There is some work being done on proof-carrying code, where the execution of a program can be tested for certain properties. See here for further info.
Slashdot Mirror
For the initial part of the task ("get from the front doors to the area of the registration desk"), Grace has no a priori information, relying on the directions given by the human it interacts with. After Grace has registered and been "given" a map, she uses a map built the night before to navigate to the location where she's to give her talk. The map, however, only includes the static environment; the navigation & localization software must deal with dynamic obstacles (such as the crowds surrounding the robot).
Actually, that is planned for the future. We currently have the ability to locate the AAAI badges that are given to all conference attendees and use OCR to extract the name of the person we're talking to (Swarthmore did that portion of the work). Next year, we'd like to try to schmooze with conference attendees about their current research by pulling down their current papers, c.v.'s, etc. off the web. In time, in time. :)
There have been efforts to blend mathematical algorithm provers with programming tools. Perhaps someone will succeed with something general enough to be able to review existing code.
There is some work being done on proof-carrying code, where the execution of a program can be tested for certain properties. See here for further info.