{"id":"https://openalex.org/W2167486530","doi":"https://doi.org/10.1109/robio.2009.4913321","title":"Generating Optimal Two-Robot Street Walk Schedules","display_name":"Generating Optimal Two-Robot Street Walk Schedules","publication_year":2009,"publication_date":"2009-02-01","ids":{"openalex":"https://openalex.org/W2167486530","doi":"https://doi.org/10.1109/robio.2009.4913321","mag":"2167486530"},"language":"en","primary_location":{"id":"doi:10.1109/robio.2009.4913321","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robio.2009.4913321","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Robotics and Biomimetics","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/A5073110265","display_name":"J.Z. Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I107949126","display_name":"University of Lethbridge","ror":"https://ror.org/044j76961","country_code":"CA","type":"education","lineage":["https://openalex.org/I107949126"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"J.Z. Zhang","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, AB, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, AB, Canada","institution_ids":["https://openalex.org/I107949126"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073110265"],"corresponding_institution_ids":["https://openalex.org/I107949126"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20796188,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":null,"first_page":"2073","last_page":"2078"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9904000163078308,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/guard","display_name":"Guard (computer science)","score":0.8037571907043457},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6184636354446411},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.591802716255188},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5827363729476929},{"id":"https://openalex.org/keywords/walk-in","display_name":"Walk-in","score":0.5651623606681824},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.41743800044059753},{"id":"https://openalex.org/keywords/simulation","display_name":"Simulation","score":0.33778417110443115},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2792145013809204},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21639388799667358},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13219571113586426},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09283030033111572}],"concepts":[{"id":"https://openalex.org/C141141315","wikidata":"https://www.wikidata.org/wiki/Q2379942","display_name":"Guard (computer science)","level":2,"score":0.8037571907043457},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6184636354446411},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.591802716255188},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5827363729476929},{"id":"https://openalex.org/C111459926","wikidata":"https://www.wikidata.org/wiki/Q7244468","display_name":"Walk-in","level":3,"score":0.5651623606681824},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.41743800044059753},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.33778417110443115},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2792145013809204},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21639388799667358},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13219571113586426},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09283030033111572},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"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.1109/robio.2009.4913321","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robio.2009.4913321","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Robotics and Biomimetics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8299999833106995,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1489894904","https://openalex.org/W1606110131","https://openalex.org/W2032994449","https://openalex.org/W2033649214","https://openalex.org/W2098367498","https://openalex.org/W2101350081","https://openalex.org/W2105293534","https://openalex.org/W2121105392","https://openalex.org/W2135705908","https://openalex.org/W2159148319","https://openalex.org/W2159175077","https://openalex.org/W2166655837","https://openalex.org/W2167333020","https://openalex.org/W6683348112","https://openalex.org/W6684363347"],"related_works":["https://openalex.org/W1597743604","https://openalex.org/W2038723108","https://openalex.org/W4254637722","https://openalex.org/W2980401999","https://openalex.org/W3016483420","https://openalex.org/W2331628363","https://openalex.org/W2393030234","https://openalex.org/W3198851420","https://openalex.org/W2379730136","https://openalex.org/W2344146818"],"abstract_inverted_index":{"Two":[0],"robots":[1],"collaboratively":[2],"search":[3],"a":[4],"street":[5,16],"area.":[6],"At":[7],"an":[8],"abstract":[9],"level,":[10],"this":[11,37],"is":[12],"the":[13,21,51],"well-known":[14],"two-guard":[15],"walk":[17,55],"problem.":[18],"Variations":[19],"of":[20,46,53],"problem,":[22],"i.e.,":[23],"general":[24],"walk,":[25,27,29,32],"straight":[26,30],"counter":[28,31],"have":[33],"been":[34],"studied.":[35],"In":[36],"work,":[38],"deepening":[39],"our":[40],"previous":[41],"work":[42],"on":[43],"simple":[44],"characterizations":[45],"walkable":[47],"streets,":[48],"we":[49],"consider":[50],"generation":[52],"optimal":[54],"schedules":[56],"by":[57],"two":[58],"robots.":[59]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}