{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:46:45Z","timestamp":1729662405696,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/tai.2003.1250186","type":"proceedings-article","created":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T21:26:50Z","timestamp":1078176410000},"page":"168-175","source":"Crossref","is-referenced-by-count":0,"title":["Search control techniques for planning"],"prefix":"10.1109","author":[{"family":"Minh Tang","sequence":"first","affiliation":[]},{"given":"A.D.","family":"Mali","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Heuristics Intelligent Search Strategies for Computer Problem Solving","year":"1984","author":"pearl","key":"ref10"},{"key":"ref11","first-page":"20","article-title":"The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving","author":"pohl","year":"1973","journal-title":"Proc IJCAI-7"},{"key":"ref12","article-title":"Variants of A * for planning","author":"tang","year":"2003","journal-title":"Technical Report"},{"key":"ref13","article-title":"On the variants of A *","author":"mali","year":"2003","journal-title":"Journal of ACM"},{"key":"ref4","first-page":"109","article-title":"Sapa: A Domain-Independent Heuristic Metric Temporal Planner","author":"do","year":"2001","journal-title":"European Conference on Planning"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00108-4"},{"key":"ref6","first-page":"57","article-title":"FF: The Fast Forward Planning System","volume":"22","author":"hoffmann","year":"2001","journal-title":"AI Magazine"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1056777.1056779","article-title":"Correction to “A formal basis for the heuristic determination of the minimum path costs","volume":"37","author":"hart","year":"1972","journal-title":"SigArt Newsletter"},{"key":"ref8","first-page":"798","article-title":"Extracting Effective and Admissible State Space Heuristics from the Planning Graph","author":"nguyen","year":"2000","journal-title":"AAAI Proceedings"},{"key":"ref7","first-page":"81","article-title":"Stan4: A Hybrid Planning Strategy based on Sub-problem Abstraction","volume":"22","author":"long","year":"2001","journal-title":"AI Magazine"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(96)00047-1"},{"key":"ref1","first-page":"47","article-title":"AIPS'00 Planning Competition","volume":"22","author":"bacchus","year":"2001","journal-title":"AI Magazine"},{"key":"ref9","article-title":"AltAlt: Combining the Advantages of Graphplan and Heuristic State Search","author":"nigenda","year":"2001","journal-title":"ASU Computer Science Technical Report"}],"event":{"name":"15th IEEE International Conference on Tools with Artificial Intelligence","acronym":"TAI-03","location":"Sacramento, CA, USA"},"container-title":["Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8840\/27974\/01250186.pdf?arnumber=1250186","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,21]],"date-time":"2018-04-21T10:26:03Z","timestamp":1524306363000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1250186\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/tai.2003.1250186","relation":{},"subject":[]}}