Responsible for this page: David Lawrence, davla@ep.liu.se
Page last updated: 2009-02-13
|
Content
| Files: | Description | File size | Format | |
| Fulltext | 249K | PDF (requires Acrobat Reader) | ||
| Fulltext, 1 st Revised |
262K | PDF (requires Acrobat Reader) | ||
| Fulltext, 2nd Revised |
264K | PDF (requires Acrobat Reader) | ||
| Fulltext | 242K | PostScript (requires a PostScript Reader) | ||
| Fulltext, 1st Revised |
239K | PostScript (requires a PostScript Reader) | ||
| Fulltext, 2nd Revised |
241K | PostScript (requires a PostScript Reader) | ||
| Author: | Erik Sandewall | |||
| Article title: | Logic-Based Modelling of Goal-Directed Behavior | |||
| Publ. type: | Article | |||
| Volume: | 2 | |||
| Article No: | 19 | |||
| Language: | English | |||
| Abstract [en]: | We address the problem of characterizing goal-directed robotic behavior using a logic of actions and change. Our approach is based on distinguishing two kinds of actions: procedural actions which are defined in a mechanistic way, and goal-directed actions which are performed through a process involving tries, possibly failures, and corrective action and new tries until the goal has been reached. (The definition of procedural actions may be done external to the logic, for example through differential equations, or through a conventional programming language). For both kinds of actions, the logic expresses explicitly whether the action succeeds or fails. Each execution of a goal-directed action is also characterized by a number of breakpoints where some sub-action has been completed and a new sub-action for getting to the desired goal is selected. The logic is used for characterizing the selection of sub-actions at breakpoints, and the success or failure of the goal-directed action in terms of the success or failure of the sub-actions. The article describes how goal-directed actions can be modelled by an extension of existing results on logics of actions and change. | |||
| Publisher: | Linköping University Electronic Press | |||
| Year: | 1997 | |||
| Available: | 1997-12-19, 1st Revised 1998-03-28, 2nd Revised 1998-07-29 | |||
| No. of pages: | 21, 1st and 2nd Revised 19 | |||
| Series: | Linköping Electronic Articles in Computer and Information Science | |||
| ISSN: | 1401-9841 | |||
| Checksum PDF: | 76341e757f44864e3f82b20a4e43d09e /home/ep/www/ea/cis/1997/019/cis97019.pdf (MD5) | |||
| Checksum PDF: | 2e0878ee97cb91f09a6e04f79ef01ff9 /home/ep/www/ea/cis/1997/019/cis97019-revised.pdf (MD5), 1st Revised | |||
| Checksum PDF: | 69e065f540edaec15202f5ab335ecdb1 /home/ep/www/ea/cis/1997/019/cis97019-revise2.pdf (MD5), 2nd Revised | |||
| Checksum PS: | 0a6bf783a8de745b6c2d3872149581ed /service/www-ep/docs/ea/cis/1997/019/cis97019.ps (MD5) | |||
| Checksum PS: | 71e813d27d11eda5f2ba4a9168f19fe9 /service/www-ep/docs/ea/cis/1997/019/cis97019-revised.ps (MD5), 1 st Revised | |||
| Checksum PS: | cfaddf83c505bcdf183e911fa4e783f3 /service/www-ep/docs/ea/cis/1997/019/cis97019-revise2.ps (MD5), 2nd Revised | |||
| PGP PDF: | PGP | |||
| PGP PDF: | PGP, 1st Revised | |||
| PGP PDF | PGP, 2nd Revised | |||
| PGP PS: | PGP | |||
| PGP PS: | PGP, 1st Revised | |||
| PGP PS: | PGP, 2nd Revised | |||
| Old Checksum: | Checksum (PS) | Information about recalculation of Checksum | |||
| Old Checksum: | Checksum (PS), 1st Revised | Information about recalculation of Checksum | |||
| Old Checksum: | Checksum (PS), 2nd Revised | Information about recalculation of Checksum | |||
| SPECIAL INFO: | Checksum, PGP and persistence | |||
REFERENCE TO THIS PAGE:
|
||||
Last updated: 2009-02-13