{"title":"Petri网框架下的人工智能规划问题","authors":"K. Passino, P. Antsaklis","doi":"10.23919/ACC.1988.4789793","DOIUrl":null,"url":null,"abstract":"Artificial Intelligence planning systems determine a sequence of actions to be taken to solve a problem. This is accomplished by generating and evaluating alternative courses of action. A special type of Petri net is first defined and then used to model a class of Artificial Intelligence planning problems. A planning strategy is developed using results from the theory of heuristic search. In particular, the A* algorithm is utilized. From the Petri net framework it is shown how to develop an admissible and consistent A* algorithm. As an illustration of the results three Artificial Intelligence planning problems are modelled and solved.","PeriodicalId":6395,"journal":{"name":"1988 American Control Conference","volume":"17 1","pages":"626-631"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"Artificial Intelligence Planning Problems in a Petri Net Framework\",\"authors\":\"K. Passino, P. Antsaklis\",\"doi\":\"10.23919/ACC.1988.4789793\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Artificial Intelligence planning systems determine a sequence of actions to be taken to solve a problem. This is accomplished by generating and evaluating alternative courses of action. A special type of Petri net is first defined and then used to model a class of Artificial Intelligence planning problems. A planning strategy is developed using results from the theory of heuristic search. In particular, the A* algorithm is utilized. From the Petri net framework it is shown how to develop an admissible and consistent A* algorithm. As an illustration of the results three Artificial Intelligence planning problems are modelled and solved.\",\"PeriodicalId\":6395,\"journal\":{\"name\":\"1988 American Control Conference\",\"volume\":\"17 1\",\"pages\":\"626-631\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1988 American Control Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/ACC.1988.4789793\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1988 American Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ACC.1988.4789793","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Artificial Intelligence Planning Problems in a Petri Net Framework
Artificial Intelligence planning systems determine a sequence of actions to be taken to solve a problem. This is accomplished by generating and evaluating alternative courses of action. A special type of Petri net is first defined and then used to model a class of Artificial Intelligence planning problems. A planning strategy is developed using results from the theory of heuristic search. In particular, the A* algorithm is utilized. From the Petri net framework it is shown how to develop an admissible and consistent A* algorithm. As an illustration of the results three Artificial Intelligence planning problems are modelled and solved.