Property Based Coordination MINES Sainttienne基于属性的协调矿山圣与#艾蒂安201.pptVIP

下载本文档

4
0
约1.33万字
约 21页
2017-03-08 发布于上海
举报
版权申诉

Property Based Coordination MINES Sainttienne基于属性的协调矿山圣与#艾蒂安201.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Property Based Coordination MINES Sainttienne基于属性的协调矿山圣与#艾蒂安201

Traveler Information System A multiagent approach for the dynamic VRPTW*(*Vehicle Routing Problem with Time Windows) MAS Environment and Transport The environment: is a shared space: A solution to give a space-time referential to the agents related to the resolution of the VRPTW problem. has its own dynamic: A solution to take into account the dynamic of the real environment. The objective is to simplify the design of the agents. defines rules for the multi-agent system: A solution to constraint perceptions and interactions of agents. The objective is to limit the number of messages. Property-based Coordination Environment modeling DVRPTW multi-agent modeling Agents: Interface Agent (IA): An IA checks the validity of the human request and creates a CA agent. Customer Agent (CA): A CA has to find the best offer for the human request. Vehicle Agent (VA): A VA computes the cost of the insertion of the request and makes offer. Use of the environment for the DVRPTW Principle : publish the routing plans of the vehicles in the form of a chained list of customer entities Objective: restrain the vehicles’ perception to the only customers they are able to visit (with filters) There is an interaction between a CA (c*) and a VA (v*) if the request (r*) of the CA can be inserted in the plan of the VA: There is a capacity (fcapacity) and a space-time (fspace_time) condition and f = fcapacity ? fspace_time fcapacity: The quantity associated to the request of c* does not exceed the current capacity of v*. fspace_time : There exist a position in the plan of v* between two adjacent customers, say c1 and c2, so that v* can visit c1, then c* and finally c2 without violating any time window of the three customers New Heuristic : space-time representation of the network Agents’ perception fields (euclidean case) Dynamics of the perception fields (euclidean case) First Experimental results Conclusion Thank for your attention.Questions ? The filter that is used has to ta