{"id":"https://openalex.org/W2109917734","doi":"https://doi.org/10.1109/case.2011.6042528","title":"A linear programming approach for probabilistic robot path planning with missing information of outcomes","display_name":"A linear programming approach for probabilistic robot path planning with missing information of outcomes","publication_year":2011,"publication_date":"2011-08-01","ids":{"openalex":"https://openalex.org/W2109917734","doi":"https://doi.org/10.1109/case.2011.6042528","mag":"2109917734"},"language":"en","primary_location":{"id":"doi:10.1109/case.2011.6042528","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case.2011.6042528","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Automation Science and Engineering","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/A5035412786","display_name":"Mohamad Ali Movafaghpour","orcid":null},"institutions":[{"id":"https://openalex.org/I1516879","display_name":"Tarbiat Modares University","ror":"https://ror.org/03mwgfy56","country_code":"IR","type":"education","lineage":["https://openalex.org/I1516879"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohamad Ali Movafaghpour","raw_affiliation_strings":["Faculty of Engineering, Tarbiat Modares University, Tehran, Iran","Faculty of Engineering , Tarbiat Modares University , Tehran , Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Tarbiat Modares University, Tehran, Iran","institution_ids":["https://openalex.org/I1516879"]},{"raw_affiliation_string":"Faculty of Engineering , Tarbiat Modares University , Tehran , Iran","institution_ids":["https://openalex.org/I1516879"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059609145","display_name":"Ellips Masehian","orcid":"https://orcid.org/0000-0003-4869-1237"},"institutions":[{"id":"https://openalex.org/I1516879","display_name":"Tarbiat Modares University","ror":"https://ror.org/03mwgfy56","country_code":"IR","type":"education","lineage":["https://openalex.org/I1516879"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Ellips Masehian","raw_affiliation_strings":["Faculty of Engineering, Tarbiat Modares University, Tehran, Iran","Faculty of Engineering , Tarbiat Modares University , Tehran , Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Tarbiat Modares University, Tehran, Iran","institution_ids":["https://openalex.org/I1516879"]},{"raw_affiliation_string":"Faculty of Engineering , Tarbiat Modares University , Tehran , Iran","institution_ids":["https://openalex.org/I1516879"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1516879"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":null,"first_page":"126","last_page":"132"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9977999925613403,"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.9977999925613403,"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/T12288","display_name":"Optimization and Search Problems","score":0.9961000084877014,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9926999807357788,"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/robot","display_name":"Robot","score":0.7815109491348267},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6928839087486267},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6719008684158325},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5746516585350037},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5728891491889954},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.5157082676887512},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5053759217262268},{"id":"https://openalex.org/keywords/doors","display_name":"Doors","score":0.4824119806289673},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4244178235530853},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.42191651463508606},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4137857258319855},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16704222559928894},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1612451672554016}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7815109491348267},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6928839087486267},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6719008684158325},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5746516585350037},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5728891491889954},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.5157082676887512},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5053759217262268},{"id":"https://openalex.org/C125209513","wikidata":"https://www.wikidata.org/wiki/Q4037520","display_name":"Doors","level":2,"score":0.4824119806289673},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4244178235530853},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.42191651463508606},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4137857258319855},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16704222559928894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1612451672554016},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/case.2011.6042528","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case.2011.6042528","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Automation Science and Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7699999809265137,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W70402205","https://openalex.org/W72226252","https://openalex.org/W115815553","https://openalex.org/W1482555259","https://openalex.org/W1523742540","https://openalex.org/W1571051474","https://openalex.org/W1963610481","https://openalex.org/W1969557107","https://openalex.org/W1982809790","https://openalex.org/W2021061679","https://openalex.org/W2032100464","https://openalex.org/W2083104145","https://openalex.org/W2084215264","https://openalex.org/W2099144379","https://openalex.org/W2114252258","https://openalex.org/W2115670157","https://openalex.org/W2119567691","https://openalex.org/W2123910366","https://openalex.org/W2151200612","https://openalex.org/W2182491007","https://openalex.org/W2294651778","https://openalex.org/W2334782222","https://openalex.org/W4210746732","https://openalex.org/W4236251699","https://openalex.org/W6602833444","https://openalex.org/W6602918191","https://openalex.org/W6634175102","https://openalex.org/W6682284981","https://openalex.org/W6686589299"],"related_works":["https://openalex.org/W3016239942","https://openalex.org/W2486091485","https://openalex.org/W4293365988","https://openalex.org/W2374188760","https://openalex.org/W2997934945","https://openalex.org/W2382905498","https://openalex.org/W1585941908","https://openalex.org/W3022460320","https://openalex.org/W2029226820","https://openalex.org/W3111705864"],"abstract_inverted_index":{"In":[0,30,101],"practical":[1],"robot":[2,35,52,87],"motion":[3],"planning,":[4,57],"robots":[5,25,79],"usually":[6],"do":[7],"not":[8],"have":[9],"full":[10],"models":[11],"of":[12,45,56,109,147],"their":[13,98],"surrounding,":[14],"and":[15,19,93,130],"hence":[16],"no":[17],"complete":[18],"correct":[20],"plan":[21],"exists":[22,60],"for":[23,114,141],"the":[24,46,51,54,86,107,145],"to":[26,50,104,129],"be":[27],"executed":[28],"fully.":[29],"most":[31,44],"real-world":[32],"problems":[33],"a":[34,39,89,94,119,136],"operates":[36],"in":[37,116,144],"just":[38],"partially-known":[40],"environment,":[41],"meaning":[42],"that":[43],"environment":[47],"is":[48,124,127,139],"known":[49],"at":[53],"time":[55],"but":[58],"there":[59],"incomplete":[61],"information":[62],"about":[63],"some":[64],"`hidden'":[65],"variables":[66,150],"which":[67,126,151],"represent":[68],"potential":[69],"blockages":[70],"(e.g.":[71],"open/closed":[72],"doors,":[73],"or":[74,80],"corridors":[75],"congested":[76],"with":[77,106],"other":[78],"obstacles).":[81],"For":[82],"these":[83],"hidden":[84,149],"variables,":[85],"has":[88],"probability":[90],"distribution":[91],"estimation":[92],"prioritized":[95],"preference":[96],"over":[97],"possible":[99],"values.":[100],"this":[102],"paper,":[103],"deal":[105],"problem":[108],"choosing":[110],"an":[111],"optimal":[112],"policy":[113],"planning":[115,143],"offline":[117],"mode,":[118],"stochastic":[120],"dynamic":[121],"programming":[122],"model":[123],"developed,":[125],"converted":[128],"solved":[131],"by":[132],"linear":[133],"programming.":[134],"Next,":[135],"heuristic":[137],"method":[138],"proposed":[140],"conditional":[142],"presence":[146],"numerous":[148],"produces":[152],"near-optimal":[153],"plans.":[154]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}