{"title":"多启发式状态空间搜索","authors":"Anirudha Bhaskar","doi":"10.1109/IEMCON.2018.8614941","DOIUrl":null,"url":null,"abstract":"State space seek is a procedure utilized as a part of the field of software engineering, including counterfeit consciousness (AI), in which progressive designs or conditions of an occasion are considered, with the objective of finding an objective state with a coveted property. In spite of the very fact that this enterprise has varied applications as well as those for movement arranging, trying with design information heuristics, AND/OR charts then on. This main objective of this paper is to run Multi-Heuristic Planner on a 3D Environment. This framework is build on this believe that multiple searches along with different in-admissible heuristics will guild the path of an object to its desired goal in a way that will preserve completeness and guarantees on suboptimality bounds.","PeriodicalId":368939,"journal":{"name":"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-Heuristic State Space Search\",\"authors\":\"Anirudha Bhaskar\",\"doi\":\"10.1109/IEMCON.2018.8614941\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"State space seek is a procedure utilized as a part of the field of software engineering, including counterfeit consciousness (AI), in which progressive designs or conditions of an occasion are considered, with the objective of finding an objective state with a coveted property. In spite of the very fact that this enterprise has varied applications as well as those for movement arranging, trying with design information heuristics, AND/OR charts then on. This main objective of this paper is to run Multi-Heuristic Planner on a 3D Environment. This framework is build on this believe that multiple searches along with different in-admissible heuristics will guild the path of an object to its desired goal in a way that will preserve completeness and guarantees on suboptimality bounds.\",\"PeriodicalId\":368939,\"journal\":{\"name\":\"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEMCON.2018.8614941\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEMCON.2018.8614941","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
State space seek is a procedure utilized as a part of the field of software engineering, including counterfeit consciousness (AI), in which progressive designs or conditions of an occasion are considered, with the objective of finding an objective state with a coveted property. In spite of the very fact that this enterprise has varied applications as well as those for movement arranging, trying with design information heuristics, AND/OR charts then on. This main objective of this paper is to run Multi-Heuristic Planner on a 3D Environment. This framework is build on this believe that multiple searches along with different in-admissible heuristics will guild the path of an object to its desired goal in a way that will preserve completeness and guarantees on suboptimality bounds.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
