{"id":"https://openalex.org/W2162161303","doi":"https://doi.org/10.1109/icmlc.2011.6016970","title":"A comparison study on the reduction of search space using frame node technique for simulation and computer games","display_name":"A comparison study on the reduction of search space using frame node technique for simulation and computer games","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2162161303","doi":"https://doi.org/10.1109/icmlc.2011.6016970","mag":"2162161303"},"language":"en","primary_location":{"id":"doi:10.1109/icmlc.2011.6016970","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmlc.2011.6016970","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on Machine Learning and Cybernetics","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019668905","display_name":"Sumet Pongphankae","orcid":null},"institutions":[{"id":"https://openalex.org/I176790772","display_name":"Murdoch University","ror":"https://ror.org/00r4sry34","country_code":"AU","type":"education","lineage":["https://openalex.org/I176790772"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Sumet Pongphankae","raw_affiliation_strings":["School of Information Technology, Murdoch University, WA, Australia"],"affiliations":[{"raw_affiliation_string":"School of Information Technology, Murdoch University, WA, Australia","institution_ids":["https://openalex.org/I176790772"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086703248","display_name":"Chun Che Fung","orcid":"https://orcid.org/0000-0001-5182-3558"},"institutions":[{"id":"https://openalex.org/I176790772","display_name":"Murdoch University","ror":"https://ror.org/00r4sry34","country_code":"AU","type":"education","lineage":["https://openalex.org/I176790772"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Chun-Che Fung","raw_affiliation_strings":["School of Information Technology, Murdoch University, WA, Australia"],"affiliations":[{"raw_affiliation_string":"School of Information Technology, Murdoch University, WA, Australia","institution_ids":["https://openalex.org/I176790772"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019668905"],"corresponding_institution_ids":["https://openalex.org/I176790772"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14456486,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1617","last_page":"1621"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12290","display_name":"Human Motion and Animation","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.7812854647636414},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7245339155197144},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.595621645450592},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.5864337682723999},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5802127122879028},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.5596814155578613},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.49058666825294495},{"id":"https://openalex.org/keywords/iterative-deepening-depth-first-search","display_name":"Iterative deepening depth-first search","score":0.4547221064567566},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.44452333450317383},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.41263970732688904},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4110944867134094},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2783786356449127},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1513662338256836},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08487868309020996},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07394903898239136}],"concepts":[{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.7812854647636414},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7245339155197144},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.595621645450592},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5864337682723999},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5802127122879028},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.5596814155578613},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.49058666825294495},{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.4547221064567566},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.44452333450317383},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.41263970732688904},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4110944867134094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2783786356449127},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1513662338256836},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08487868309020996},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07394903898239136},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icmlc.2011.6016970","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmlc.2011.6016970","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on Machine Learning and Cybernetics","raw_type":"proceedings-article"},{"id":"pmh:oai:researchrepository.murdoch.edu.au:6014","is_oa":false,"landing_page_url":"https://researchrepository.murdoch.edu.au/id/eprint/6014/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400274","display_name":"Murdoch Research Repository (Murdoch University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I176790772","host_organization_name":"Murdoch University","host_organization_lineage":["https://openalex.org/I176790772"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"  Pongphankae, S. <https://researchrepository.murdoch.edu.au/view/author/Pongphankae, Sumet.html> and Fung, C.C. <https://researchrepository.murdoch.edu.au/view/author/Fung, Lance (Chun Che).html>ORCID: 0000-0001-5182-3558 <http://orcid.org/0000-0001-5182-3558>   (2011)  A comparison study on the reduction of search space using frame node technique for simulation and computer games.    In: International Conference on Machine Learning and Cybernetics, ICMLC 2011, 10 - 13 July, Guilin, China  pp. 1617-1621.  ","raw_type":"Conference Paper"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.665.8900","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.665.8900","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://researchrepository.murdoch.edu.au/6014/1/comparison_study_2011.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W104507782","https://openalex.org/W128952136","https://openalex.org/W1588404442","https://openalex.org/W1975423918","https://openalex.org/W2114901363","https://openalex.org/W2167994996","https://openalex.org/W2185279145","https://openalex.org/W6604184743","https://openalex.org/W6605226796","https://openalex.org/W6677364413","https://openalex.org/W6684522131","https://openalex.org/W6686270302"],"related_works":["https://openalex.org/W2224555876","https://openalex.org/W2081821176","https://openalex.org/W58921990","https://openalex.org/W4386269615","https://openalex.org/W2402589461","https://openalex.org/W2358427436","https://openalex.org/W2064794194","https://openalex.org/W2137888986","https://openalex.org/W2808808802","https://openalex.org/W1483073478"],"abstract_inverted_index":{"In":[0,40,106,122],"simulation":[1,35],"and":[2,15,21,36,66,73,90,100,120],"computer":[3,82],"game":[4,37],"domains,":[5],"two":[6],"issues":[7],"related":[8,60],"to":[9,42,61,96],"pathfinding":[10],"problems":[11],"are":[12,118],"search":[13,16,30,50,57,104,115,151],"algorithm":[14],"space.":[17],"This":[18,138],"paper":[19,139],"describes":[20],"compares":[22],"four":[23,109,149],"techniques":[24,110],"used":[25,127],"for":[26,111],"the":[27,44,62,79,86,97,103,112,129,142,146],"reduction":[28,101,113],"of":[29,49,56,64,71,81,88,102,114,148],"space":[31,51,58,116],"generation":[32],"in":[33,128],"2-D":[34],"world":[38],"environments.":[39],"order":[41],"improve":[43],"computational":[45],"overheads,":[46],"reducing":[47,85],"size":[48,55,117],"is":[52,59,136],"necessary.":[53],"The":[54],"number":[63,70,87],"nodes":[65,72,89,126],"edges.":[67],"A":[68],"high":[69],"edges":[74,91],"will":[75,92],"have":[76],"implications":[77],"on":[78],"usage":[80,99],"memory.":[83],"Therefore,":[84],"bring":[93],"direct":[94],"benefits":[95],"memory":[98],"time.":[105],"this":[107,123],"study,":[108],"compared":[119],"investigated.":[121],"paper,":[124],"frame":[125],"hierarchical":[130,150],"adaptive":[131],"flood":[132],"filled":[133],"(HAFF)":[134],"technique":[135],"presented.":[137],"also":[140],"presents":[141],"comparison":[143],"results":[144],"from":[145],"application":[147],"spaces.":[152]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}