arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.00805cs.AIcs.MA
收藏

一种新的动态分布式规划方法:在DPDP问题中的应用

A New Dynamic Distributed Planning Approach: Application to DPDP Problems

Zakaria Tolba

AI总结:

本文提出一种面向DPDP问题的动态分布式规划方法,在动作集合随环境变化时,由各智能体结合未执行旧动作与新动作,利用遗传算法满足约束并重新生成计划,且通过具体案例验证其效用。

摘要:

在本工作中,我们提出了一种新的动态分布式规划方法,该方法能够考虑智能体在其待规划动作集合上引入的变化,从而考虑其环境中发生的变化。我们的方法适用于分布式规划的语境,即面向分布式计划,其中每个智能体都可以生成自己的计划。根据我们的方法,计划的生成基于通过使用遗传算法对约束的满足。我们的方法是:每当智能体的待规划动作集合发生变化时,由每个智能体生成一个新计划。这样做是为了将引入其新计划中的新动作考虑在内。在这个新计划中,智能体每次都把旧计划中所有尚未执行的旧动作以及由变化产生的新动作作为新的待规划动作集,并把智能体动作集合发生变化时所处的状态作为新的初始状态。在我们的工作中,我们使用了一个具体案例来说明并证明我们方法的效用。

英文摘要:

In this work, we proposed a new dynamic distributed planning approach that is able to take into account the changes that the agent introduces on his set of actions to be planned in order to take into account the changes that occur in his environment. Our approach fits into the context of distributed planning for distributed plans where each agent can produce its own plans. According to our approach the generation of the plans is based on the satisfaction of the constraints by the use of the genetic algorithms. Our approach is to generate, a new plan by each agent, whenever there is a change in its set of actions to plan. This in order to take into account the new actions introduced in its new plan. In this new plan, the agent takes, each time, as a new action set to plan all the old un-executed actions of the old plan and the new actions engendered by the changes and as a new initial state; the state in which the set of actions of the agent undergoes a change. In our work, we used a concrete case to illustrate and demonstrate the utility of our approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑