{"id":"https://openalex.org/W2912964491","doi":"https://doi.org/10.1109/cdc.2018.8619486","title":"Geometric Reinforcement Learning Based Path Planning for Mobile Sensor Networks in Advection-Diffusion Field Reconstruction","display_name":"Geometric Reinforcement Learning Based Path Planning for Mobile Sensor Networks in Advection-Diffusion Field Reconstruction","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2912964491","doi":"https://doi.org/10.1109/cdc.2018.8619486","mag":"2912964491"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2018.8619486","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2018.8619486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5040703488","display_name":"Jie You","orcid":"https://orcid.org/0009-0007-0189-4965"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jie You","raw_affiliation_strings":["Department of Electrical, Computer, and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical, Computer, and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073774664","display_name":"Wencen Wu","orcid":"https://orcid.org/0000-0002-9080-754X"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wencen Wu","raw_affiliation_strings":["Department of Electrical, Computer, and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical, Computer, and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I165799507"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1949","last_page":"1954"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9970999956130981,"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"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9642000198364258,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7419182062149048},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6039530038833618},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.5576267838478088},{"id":"https://openalex.org/keywords/estimator","display_name":"Estimator","score":0.4956730604171753},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.48378321528434753},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45204973220825195},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4425743818283081},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4352569878101349},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.41406726837158203},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.41210219264030457},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3187195360660553},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.29941898584365845},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2967696785926819},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16575297713279724}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7419182062149048},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6039530038833618},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.5576267838478088},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.4956730604171753},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.48378321528434753},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45204973220825195},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4425743818283081},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4352569878101349},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.41406726837158203},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.41210219264030457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3187195360660553},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29941898584365845},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2967696785926819},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16575297713279724},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2018.8619486","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2018.8619486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1498395183","https://openalex.org/W1973573057","https://openalex.org/W1974676331","https://openalex.org/W1982957487","https://openalex.org/W1994820866","https://openalex.org/W2031791212","https://openalex.org/W2037069310","https://openalex.org/W2076006297","https://openalex.org/W2116810757","https://openalex.org/W2142425726","https://openalex.org/W2160222800","https://openalex.org/W2165726932","https://openalex.org/W2169822448","https://openalex.org/W2569137606","https://openalex.org/W2569210644","https://openalex.org/W2734903520","https://openalex.org/W2782777399","https://openalex.org/W4232655469"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W2106119116","https://openalex.org/W2904203243","https://openalex.org/W3139139461","https://openalex.org/W2125569607","https://openalex.org/W2084091668","https://openalex.org/W3204808601"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,21,49,66,92,98,153,188],"geometric":[3,68],"reinforcement":[4,69],"learning":[5,70],"algorithm":[6,72],"for":[7,11,75,187],"real-time":[8,77,140],"path":[9,56,78,111,141,150],"planning":[10,142],"mobile":[12],"sensor":[13],"networks":[14],"(MSNs)":[15],"in":[16,62,152],"the":[17,27,40,45,55,58,64,76,88,105,108,113,117,122,125,129,132,136,139,148,168,179,184],"problem":[18,143,151],"of":[19,57,83,94,107,110,124,131,166,183],"reconstructing":[20,63],"spatial-temporal":[22],"varying":[23],"field":[24,126],"described":[25],"by":[26],"advection-diffusion":[28],"partial":[29],"differential":[30],"equation.":[31],"A":[32],"Luenberger":[33],"state":[34],"estimator":[35],"is":[36,60,73,85,171],"provided":[37],"to":[38,86,96,147,177],"reconstruct":[39],"concentration":[41],"field,":[42,65],"which":[43,103,156],"uses":[44],"collected":[46],"measurements":[47],"from":[48],"MSN":[50,59],"along":[51],"its":[52],"trajectory.":[53],"Since":[54],"critical":[61],"novel":[67],"(GRL)":[71],"developed":[74],"planning.":[79],"The":[80,164],"basic":[81],"idea":[82],"GRL":[84,119,186],"divide":[87],"whole":[89],"area":[90],"into":[91],"series":[93],"lattice":[95],"employ":[97],"specific":[99],"time-varying":[100],"reward":[101,137,169],"matrix,":[102,138],"contains":[104],"information":[106],"length":[109],"and":[112,128,181],"mapping":[114],"error.":[115],"Thus,":[116],"proposed":[118,185],"can":[120,144,157],"balance":[121],"performance":[123],"reconstruction":[127],"efficiency":[130],"path.":[133],"By":[134],"updating":[135],"be":[145,158],"converted":[146],"shortest":[149],"weighted":[154],"graph,":[155],"solved":[159],"efficiently":[160],"using":[161],"dynamic":[162],"programming.":[163],"convergence":[165],"calculating":[167],"matrix":[170],"theoretically":[172],"proven.":[173],"Simulation":[174],"results":[175],"serve":[176],"demonstrate":[178],"effectiveness":[180],"feasibility":[182],"MSN.":[189]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2020,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}