乐胖代购免代理版

{"id":"https://openalex.org/W2100986220","doi":"https://doi.org/10.1109/robot.1989.100129","title":"Time-minimal paths among moving obstacles","display_name":"Time-minimal paths among moving obstacles","publication_year":2003,"publication_date":"2003-01-07","ids":{"openalex":"https://openalex.org/W2100986220","doi":"https://doi.org/10.1109/robot.1989.100129","mag":"2100986220"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.1989.100129","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5112249344","display_name":"Kikuo Fujimura","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Fujimura","raw_affiliation_strings":["Dept. of Computer Sci., Maryland Univ., College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Sci., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087437068","display_name":"Hanan Samet","orcid":"https://orcid.org/0000-0001-8230-0653"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. Samet","raw_affiliation_strings":["Dept. of Computer Sci., Maryland Univ., College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Sci., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.426,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":39,"citation_normalized_percentile":{"value":0.785747,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":91},"biblio":{"volume":null,"issue":null,"first_page":"1110","last_page":"1115"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9938,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9908,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/path-planning","display_name":"Path Planning","score":0.572117},{"id":"https://openalex.org/keywords/optimal-motion-planning","display_name":"Optimal Motion Planning","score":0.571062},{"id":"https://openalex.org/keywords/probabilistic-roadmaps","display_name":"Probabilistic Roadmaps","score":0.520927},{"id":"https://openalex.org/keywords/real-time-planning","display_name":"Real-Time Planning","score":0.517534},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.51418567},{"id":"https://openalex.org/keywords/robot-navigation","display_name":"Robot Navigation","score":0.501629},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.46085945},{"id":"https://openalex.org/keywords/visibility-graph","display_name":"Visibility graph","score":0.4486327}],"concepts":[{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.7646842},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.58047837},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.57996064},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.560352},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5399994},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5322193},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.51418567},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.49725106},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.46085945},{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.4486327},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4432208},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4068155},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39414677},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35711023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35335565},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.33978462},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2237429},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1028232},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"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":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.1989.100129","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.8}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":18,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1986014106","https://openalex.org/W2004815408","https://openalex.org/W2014320134","https://openalex.org/W2050232743","https://openalex.org/W2055891854","https://openalex.org/W2111734814","https://openalex.org/W2115091574","https://openalex.org/W2124902334","https://openalex.org/W2131988161","https://openalex.org/W2133358493","https://openalex.org/W2151521059","https://openalex.org/W2163178194","https://openalex.org/W2166462345","https://openalex.org/W2170220350","https://openalex.org/W2312064194","https://openalex.org/W261809690","https://openalex.org/W2735847404"],"related_works":["https://openalex.org/W4387789462","https://openalex.org/W4311233134","https://openalex.org/W4240339429","https://openalex.org/W338234595","https://openalex.org/W3081967711","https://openalex.org/W2394276631","https://openalex.org/W2314484939","https://openalex.org/W2154141401","https://openalex.org/W2123516473","https://openalex.org/W2044243445"],"abstract_inverted_index":{"Motion":[0],"planning":[1],"for":[2,115],"a":[3,9,16,22,26,43,51,54,65,68,98,104,117],"point":[4,30,52,87],"robot":[5],"is":[6,15,57,61,75,88,101,113,124],"studied":[7],"in":[8,21,108],"two-dimensional":[10],"time-varying":[11],"environment.":[12],"The":[13,29,46,73],"obstacle":[14],"convex":[17],"polygon":[18],"that":[19,82],"moves":[20,41],"fixed":[23],"direction":[24],"at":[25],"constant":[27],"speed.":[28],"to":[31,35,53,63,77,90],"be":[32],"reached":[33],"(referred":[34],"as":[36,103],"the":[37,85,96,109],"destination":[38],"point)":[39],"also":[40],"along":[42],"known":[44],"path.":[45],"concept":[47],"of":[48,70,95,106],"accessibility":[49],"from":[50],"moving":[55,71,86],"object":[56],"introduced,":[58],"and":[59,120],"it":[60],"used":[62],"define":[64],"graph":[66,74],"on":[67],"set":[69],"obstacles.":[72],"shown":[76],"exhibit":[78],"an":[79],"important":[80],"property,":[81],"is,":[83],"if":[84],"able":[89],"move":[91],"faster":[92],"than":[93],"any":[94],"obstacles,":[97],"time-minimal":[99,118],"path":[100],"given":[102],"sequence":[105],"edges":[107],"graph.":[110],"An":[111],"algorithm":[112],"described":[114],"generating":[116],"path,":[119],"its":[121],"execution":[122],"time":[123],"analyzed.<":[125],">":[128]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2100986220","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2024-12-05T20:13:46.831444","created_date":"2016-06-24"}