D. Toropila, Filip Dvorak, Otakar Trunda, Martin Hanes, R. Barták
{"title":"解决Petrobras挑战的三种方法:利用规划技术解决现实生活中的物流问题","authors":"D. Toropila, Filip Dvorak, Otakar Trunda, Martin Hanes, R. Barták","doi":"10.1109/ICTAI.2012.34","DOIUrl":null,"url":null,"abstract":"The Petrobras domain is an abstraction of a real-life problem of resource-efficient transportation of goods from ports to petroleum platforms. Being a good example of a difficult problem standing on the borderline between planning and scheduling, this domain was proposed as a challenge problem at the International Competition on Knowledge Engineering for Planning and Scheduling (ICKEPS 2012). In this paper we describe three different ways of modeling and solving this domain: by utilizing classical planning, temporal planning, and finally, single-player games and Monte-Carlo Tree Search.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Three Approaches to Solve the Petrobras Challenge: Exploiting Planning Techniques for Solving Real-Life Logistics Problems\",\"authors\":\"D. Toropila, Filip Dvorak, Otakar Trunda, Martin Hanes, R. Barták\",\"doi\":\"10.1109/ICTAI.2012.34\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Petrobras domain is an abstraction of a real-life problem of resource-efficient transportation of goods from ports to petroleum platforms. Being a good example of a difficult problem standing on the borderline between planning and scheduling, this domain was proposed as a challenge problem at the International Competition on Knowledge Engineering for Planning and Scheduling (ICKEPS 2012). In this paper we describe three different ways of modeling and solving this domain: by utilizing classical planning, temporal planning, and finally, single-player games and Monte-Carlo Tree Search.\",\"PeriodicalId\":155588,\"journal\":{\"name\":\"2012 IEEE 24th International Conference on Tools with Artificial Intelligence\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE 24th International Conference on Tools with Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTAI.2012.34\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2012.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Three Approaches to Solve the Petrobras Challenge: Exploiting Planning Techniques for Solving Real-Life Logistics Problems
The Petrobras domain is an abstraction of a real-life problem of resource-efficient transportation of goods from ports to petroleum platforms. Being a good example of a difficult problem standing on the borderline between planning and scheduling, this domain was proposed as a challenge problem at the International Competition on Knowledge Engineering for Planning and Scheduling (ICKEPS 2012). In this paper we describe three different ways of modeling and solving this domain: by utilizing classical planning, temporal planning, and finally, single-player games and Monte-Carlo Tree Search.