| Files: | Description | File size | Format | Browse |
| Fulltext | 0.11 MB | PDF (requires Acrobat Reader) | Previous | Next |
| PostScript | | | |
| | |
| Authors: | Ching Choo Voon: Singapore Polytechnic, Singapore |
| | Ching Siang Boo: Singapore Polytechnic, Singapore |
| | Danny Hong Tai Neo: Singapore Polytechnic, Singapore |
| | Liang Jie Wong: Singapore Polytechnic, Singapore |
| Publication title: | SP-United: Applying Last Action As Feedback For A.I. Agents |
| Conference: | RobocCup-99 Team Descriptions. Simulation League |
| Publication type: | Abstract and Fulltext |
| Issue: | 004 |
| Article No.: | 028 |
| Abstract: | This paper describes the use of a last action feedback loop to compliment the use of a decision tree in a reactive agent. It aims to create a team of reactive agents that is semi - goal orientated.
Computer programs, artificially intelligent or not, will generally display the characteristic of performing identical actions when given near identical situations. This is due to the lack of human intuition to generate the element of unpredictability. The simulator league is also similar. A client in the simulator league no matter how advanced has to make decisions based on its creators source codes. Since the span of the source codes is usually very general it limits the flexibility of the client player. Hence if we could provide identical situations to the client we would almost be sure that it would react identically. This would be true, especially if its last action was successful. Therefore, if we could just remember this last action taken by the enemy and the condition under which it happened we could exploit this weakness and use it to our advantage. |
| Language: | English |
| Year: | 1999 |
| No. of pages: | 1 |
| Pages: | 129 |
| Series: | Linköping Electronic Conference Proceedings |
| ISSN (print): | 1650-3686 |
| ISSN (online): | 1650-3740 |
| File: | http://www.ep.liu.se/ea/cis/1999/007/28/cis9900728.pdf |
| Available: | 1999-12-15 |
| Publisher: | Linköping University Electronic Press, Linköpings universitet |
|
| REFERENCE TO THIS PAGE |