<问题中的统一成本搜索> [英] uniform cost search in problem &gt;

问题描述

假设在100

平方的环境中（总计10,000点）

我们有3辆救护车和5个在那里服务的电话。假设初始位置并且在输入可用时呼叫救护车，目标是找到每个联系人的救护车的最佳分配，以便最短的响应时间来回答所有5个呼叫。


每次通话的服务时间为2秒



和每次通话的距离是曼哈顿。



使用统一成本搜索来解决这个问题

Suppose that in an environment of 100
Squares (a total of 10,000 points)
we have 3 ambulance and 5 calls to service there. Assuming the initial position and call an ambulance as the input is available, the goal is to find the optimal allocation of ambulances to each contact, so that shortest response time to answer all 5 calls.

service time to each call is 2 sec

and distance to each call,is Manhattan.

do this problem with uniform cost search

推荐答案

我们不做你的功课：这是有原因的。它就是为了让你思考你被告知的事情，并试着理解它。它也在那里，以便您的导师可以识别您身体虚弱的区域，并将更多的注意力集中在补救措施上。



亲自尝试，你可能会发现它不是和你想的一样困难！

We do not do your homework: it is set for a reason. It is there so that you think about what you have been told, and try to understand it. It is also there so that your tutor can identify areas where you are weak, and focus more attention on remedial action.

Try it yourself, you may find it is not as difficult as you think!

这篇关于<问题中的统一成本搜索>的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！