Real time planning in N-dim state space

José Simó , Alfons Crespo
{"title":"Real time planning in N-dim state space","authors":"José Simó ,&nbsp;Alfons Crespo","doi":"10.1016/0066-4138(94)90083-3","DOIUrl":null,"url":null,"abstract":"<div><p>This paper presents the actual work in real-time planning as search [1] [2]. Based in this work we tried to solve the path planning in numerical state space. We found that precision, performance, and time were very linked. In real-time problem solving, the agent can fall in traps made of forbidden zones and to go out it, have to spend too much computing time. To solve this problem we propose a multilayer inference based in subgoals computation. An architecture based in two agents, one for low level task with the maximum precision and other for subgoals computation is proposed here.</p></div>","PeriodicalId":100097,"journal":{"name":"Annual Review in Automatic Programming","volume":"19 ","pages":"Pages 307-312"},"PeriodicalIF":0.0000,"publicationDate":"1994-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0066-4138(94)90083-3","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annual Review in Automatic Programming","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0066413894900833","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents the actual work in real-time planning as search [1] [2]. Based in this work we tried to solve the path planning in numerical state space. We found that precision, performance, and time were very linked. In real-time problem solving, the agent can fall in traps made of forbidden zones and to go out it, have to spend too much computing time. To solve this problem we propose a multilayer inference based in subgoals computation. An architecture based in two agents, one for low level task with the maximum precision and other for subgoals computation is proposed here.

N-dim状态空间中的实时规划
本文介绍了实时规划中的实际工作,如搜索[1]b[2]。在此基础上,我们尝试解决数值状态空间中的路径规划问题。我们发现精确度、性能和时间是紧密相连的。在实时问题求解中,智能体可能会陷入禁区构成的陷阱中,而要走出这个陷阱,需要花费大量的计算时间。为了解决这个问题,我们提出了一种基于子目标计算的多层推理方法。提出了一种基于两个智能体的体系结构,一个用于高精度的低级任务,另一个用于子目标的计算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信