No-regret path planning for temporal logic tasks in partially-known environments

The International Journal of Robotics Research Study, Ahead of Publish.
In this paper, we examine the graph-based robotic course preparation trouble for top-level specs defined by co-safe straight temporal reasoning (scLTL) solutions. Our emphasis gets on situations where the map geometry of the work space is onlypartially-known.

发布者:Dr.Durant,转转请注明出处:https://robotalks.cn/no-regret-path-planning-for-temporal-logic-tasks-in-partially-known-environments/

(0)
上一篇 26 4 月, 2025
下一篇 26 4 月, 2025

相关推荐

发表回复

您的邮箱地址不会被公开。 必填项已用 * 标注

联系我们

400-800-8888

在线咨询: QQ交谈

邮件:admin@example.com

工作时间:周一至周五,9:30-18:30,节假日休息

关注微信
社群的价值在于通过分享与互动,让想法产生更多想法,创新激发更多创新。