{"id":"https://openalex.org/W2903479284","doi":"https://doi.org/10.3233/978-1-61499-927-0-12","title":"Research of Subgroups Algorithms for Multi-Tasking Cooperative Path Planning","display_name":"Research of Subgroups Algorithms for Multi-Tasking Cooperative Path Planning","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2903479284","doi":"https://doi.org/10.3233/978-1-61499-927-0-12","mag":"2903479284"},"language":"en","primary_location":{"id":"doi:10.3233/978-1-61499-927-0-12","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-61499-927-0-12","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","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/A5110148213","display_name":"Zhou Jing","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhou Jing","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110148213"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20592161,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9927999973297119,"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.9927999973297119,"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/computer-science","display_name":"Computer science","score":0.6197805404663086},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5451381802558899},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45095884799957275},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.36896464228630066},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3472800552845001},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11770308017730713}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6197805404663086},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5451381802558899},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45095884799957275},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36896464228630066},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3472800552845001},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11770308017730713}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/978-1-61499-927-0-12","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-61499-927-0-12","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"Subgroup":[0],"algorithm":[1,51,75,114],"composed":[2],"of":[3,25,105],"the":[4,10,20,33,39,43,48,53,61,78,83,87,94,106,119],"intelligent":[5,26,74],"algorithms":[6],"is":[7],"proposed":[8],"for":[9,19,68,93],"multi-tasking":[11,107],"cooperative":[12,108],"path":[13,80,109],"planning,":[14],"which":[15,90],"can":[16,115],"avoid":[17],"obstacle":[18],"complex":[21,99],"environment.":[22],"Five":[23],"kinds":[24],"multi-task":[27,95],"collaborative":[28,96],"planning":[29,97,110],"algorithms,":[30],"such":[31],"as":[32],"particle":[34],"swarm":[35],"optimization":[36],"(PSO)":[37],"algorithm,":[38,42,47,55,89],"eight-direction":[40],"recursive":[41],"artificial":[44],"potential":[45],"field":[46],"ant":[49],"colony":[50],"and":[52,103],"A*":[54],"are":[56,63,91],"all":[57],"integrated":[58],"together,":[59],"then":[60],"agents":[62],"divided":[64],"into":[65],"each":[66,69,73],"subgroup":[67,88,113],"task":[70],"based":[71,111],"on":[72,112],"to":[76],"find":[77],"optimal":[79],"corresponding":[81],"with":[82],"constraints,":[84],"thus":[85],"formed":[86],"suitable":[92],"in":[98],"scenes.":[100],"The":[101],"effectiveness":[102],"feasibility":[104],"be":[116],"verified":[117],"from":[118],"experiment":[120],"results.":[121]},"counts_by_year":[],"updated_date":"2025-12-28T23:10:05.387466","created_date":"2025-10-10T00:00:00"}