{"id":"https://openalex.org/W1966368501","doi":"https://doi.org/10.1142/s012905410400273x","title":"FAST PURSUIT OF MOBILE NODES USING TPR TREES","display_name":"FAST PURSUIT OF MOBILE NODES USING TPR TREES","publication_year":2004,"publication_date":"2004-10-01","ids":{"openalex":"https://openalex.org/W1966368501","doi":"https://doi.org/10.1142/s012905410400273x","mag":"1966368501"},"language":"en","primary_location":{"id":"doi:10.1142/s012905410400273x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905410400273x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-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/A5057915424","display_name":"Sahar Idwan","orcid":"https://orcid.org/0000-0002-3602-4325"},"institutions":[{"id":"https://openalex.org/I167576493","display_name":"Colorado School of Mines","ror":"https://ror.org/04raf6v53","country_code":"US","type":"education","lineage":["https://openalex.org/I167576493"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"SAHAR IDWAN","raw_affiliation_strings":["Department of Mathematical and Computer Sciences, Colorado School of Mines, Golden, CO 80401, USA","Department of Mathematical and Computer Sciences , Colorado School of Mines , Golden, CO 80401, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical and Computer Sciences, Colorado School of Mines, Golden, CO 80401, USA","institution_ids":["https://openalex.org/I167576493"]},{"raw_affiliation_string":"Department of Mathematical and Computer Sciences , Colorado School of Mines , Golden, CO 80401, USA","institution_ids":["https://openalex.org/I167576493"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056653646","display_name":"Dinesh P. Mehta","orcid":"https://orcid.org/0000-0002-7521-5781"},"institutions":[{"id":"https://openalex.org/I167576493","display_name":"Colorado School of Mines","ror":"https://ror.org/04raf6v53","country_code":"US","type":"education","lineage":["https://openalex.org/I167576493"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"DINESH P. MEHTA","raw_affiliation_strings":["Department of Mathematical and Computer Sciences, Colorado School of Mines, Golden, CO 80401, USA","Department of Mathematical and Computer Sciences , Colorado School of Mines , Golden, CO 80401, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical and Computer Sciences, Colorado School of Mines, Golden, CO 80401, USA","institution_ids":["https://openalex.org/I167576493"]},{"raw_affiliation_string":"Department of Mathematical and Computer Sciences , Colorado School of Mines , Golden, CO 80401, USA","institution_ids":["https://openalex.org/I167576493"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015621968","display_name":"Mario A. L\u00f3pez","orcid":"https://orcid.org/0000-0002-1861-0603"},"institutions":[{"id":"https://openalex.org/I131651094","display_name":"University of Denver","ror":"https://ror.org/04w7skc03","country_code":"US","type":"education","lineage":["https://openalex.org/I131651094"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MARIO A. LOPEZ","raw_affiliation_strings":["Department of Computer Science, University of Denver, Denver, CO 80208, USA","Department of Computer Science, University of Denver, Denver, CO 80208, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Denver, Denver, CO 80208, USA","institution_ids":["https://openalex.org/I131651094"]},{"raw_affiliation_string":"Department of Computer Science, University of Denver, Denver, CO 80208, USA#TAB#","institution_ids":["https://openalex.org/I131651094"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08854936,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"05","first_page":"753","last_page":"772"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.989799976348877,"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.989799976348877,"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/T11106","display_name":"Data Management and Algorithms","score":0.9850000143051147,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9825000166893005,"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/pursuer","display_name":"Pursuer","score":0.9086934328079224},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7242166996002197},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6746984124183655},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6366727948188782},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.609953761100769},{"id":"https://openalex.org/keywords/mobile-computing","display_name":"Mobile computing","score":0.43483883142471313},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37786391377449036},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3671568036079407},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3525552451610565},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17127549648284912},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1493569314479828},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14501044154167175}],"concepts":[{"id":"https://openalex.org/C2776927521","wikidata":"https://www.wikidata.org/wiki/Q468489","display_name":"Pursuer","level":2,"score":0.9086934328079224},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7242166996002197},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6746984124183655},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6366727948188782},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.609953761100769},{"id":"https://openalex.org/C144543869","wikidata":"https://www.wikidata.org/wiki/Q2738570","display_name":"Mobile computing","level":2,"score":0.43483883142471313},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37786391377449036},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3671568036079407},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3525552451610565},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17127549648284912},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1493569314479828},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14501044154167175},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012905410400273x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905410400273x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2070074980","https://openalex.org/W2168223208","https://openalex.org/W2182576760","https://openalex.org/W4206231591"],"related_works":["https://openalex.org/W2066061202","https://openalex.org/W114019308","https://openalex.org/W2134595317","https://openalex.org/W4285130069","https://openalex.org/W2547808144","https://openalex.org/W2058257072","https://openalex.org/W1956562143","https://openalex.org/W2091926052","https://openalex.org/W2914625303","https://openalex.org/W2053685668"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"consider":[4],"a":[5,33,42,67,80],"set":[6,34],"of":[7,11,23,35,75,88],"mobile":[8,25,77,90],"nodes,":[9,78],"each":[10],"which":[12,22],"moves":[13],"with":[14],"constant":[15],"velocity.":[16],"We":[17,40,52],"present":[18],"algorithms":[19,55,101],"to":[20,47,61,109],"determine":[21],"these":[24,49],"nodes":[26,91],"can":[27],"be":[28],"captured":[29],"the":[30,59,76,89,111],"soonest":[31],"by":[32],"one":[36],"or":[37],"more":[38],"pursuers.":[39,95],"use":[41],"time":[43],"parameterized":[44],"R-tree":[45],"(TPR-tree)":[46],"index":[48],"moving":[50],"points.":[51],"then":[53],"develop":[54],"that":[56,70,83,99],"operate":[57],"on":[58],"TPR-tree":[60],"answer":[62],"three":[63],"query":[64],"variations:":[65],"(1)":[66],"single":[68,81],"pursuer":[69,82],"is":[71,84],"faster":[72,105],"than":[73,86,106],"all":[74],"(2)":[79],"slower":[85],"some":[87],"and":[92,104],"(3)":[93],"multiple":[94],"Experimental":[96],"results":[97],"show":[98],"our":[100],"are":[102],"simpler":[103],"other":[107],"approaches":[108],"solve":[110],"problem.":[112]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}