{"id":"https://openalex.org/W4386323957","doi":"https://doi.org/10.1109/isie51358.2023.10228055","title":"Analysing navigation paths in constrained graphs using Petri nets","display_name":"Analysing navigation paths in constrained graphs using Petri nets","publication_year":2023,"publication_date":"2023-06-19","ids":{"openalex":"https://openalex.org/W4386323957","doi":"https://doi.org/10.1109/isie51358.2023.10228055"},"language":"en","primary_location":{"id":"doi:10.1109/isie51358.2023.10228055","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isie51358.2023.10228055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 32nd International Symposium on Industrial Electronics (ISIE)","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/A5100738132","display_name":"L\u00fa\u0131s Gomes","orcid":"https://orcid.org/0000-0003-4299-8270"},"institutions":[{"id":"https://openalex.org/I4210127031","display_name":"Uninova","ror":"https://ror.org/0373te416","country_code":"PT","type":"funder","lineage":["https://openalex.org/I4210127031"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Luis Gomes","raw_affiliation_strings":["NOVA University Lisbon,School of Science and Technology Center of Technology and Systems, UNINOVA,Caparica,Portugal","School of Science and Technology Center of Technology and Systems, UNINOVA, NOVA University Lisbon, Caparica, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NOVA University Lisbon,School of Science and Technology Center of Technology and Systems, UNINOVA,Caparica,Portugal","institution_ids":[]},{"raw_affiliation_string":"School of Science and Technology Center of Technology and Systems, UNINOVA, NOVA University Lisbon, Caparica, Portugal","institution_ids":["https://openalex.org/I4210127031"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008902017","display_name":"Jos\u00e9 Ribeiro-Gomes","orcid":null},"institutions":[{"id":"https://openalex.org/I4210154254","display_name":"Instituto Superior de Tecnologias Avan\u00e7adas","ror":"https://ror.org/04hzbg791","country_code":"PT","type":"education","lineage":["https://openalex.org/I4210154254"]},{"id":"https://openalex.org/I4387152517","display_name":"Instituto Superior T\u00e9cnico","ror":"https://ror.org/03db2by73","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103","https://openalex.org/I4387152517"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Jos\u00e9 Ribeiro-Gomes","raw_affiliation_strings":["Computer and Robot Vision Laboratory (VisLab) Instituto Superior Tecnico, IST,Lisbon,Portugal","Computer and Robot Vision Laboratory (VisLab) Instituto Superior Tecnico, IST, Lisbon, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Robot Vision Laboratory (VisLab) Instituto Superior Tecnico, IST,Lisbon,Portugal","institution_ids":["https://openalex.org/I4210154254"]},{"raw_affiliation_string":"Computer and Robot Vision Laboratory (VisLab) Instituto Superior Tecnico, IST, Lisbon, Portugal","institution_ids":["https://openalex.org/I4210154254","https://openalex.org/I4387152517"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1214,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.41420462,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9986000061035156,"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.9986000061035156,"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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9940999746322632,"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/T10444","display_name":"Context-Aware Activity Recognition Systems","score":0.9919999837875366,"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/reachability","display_name":"Reachability","score":0.906798779964447},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.875444769859314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8243991136550903},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.59686279296875},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5402313470840454},{"id":"https://openalex.org/keywords/translation","display_name":"Translation (biology)","score":0.471851110458374},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.4670969843864441},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.456277996301651},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4388551712036133},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.43127143383026123},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.4257693886756897},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.42280787229537964},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35772505402565},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.17431321740150452}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.906798779964447},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.875444769859314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8243991136550903},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.59686279296875},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5402313470840454},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.471851110458374},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.4670969843864441},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.456277996301651},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4388551712036133},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.43127143383026123},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.4257693886756897},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.42280787229537964},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35772505402565},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17431321740150452},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C105580179","wikidata":"https://www.wikidata.org/wiki/Q188928","display_name":"Messenger RNA","level":3,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isie51358.2023.10228055","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isie51358.2023.10228055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 32nd International Symposium on Industrial Electronics (ISIE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1935926926","https://openalex.org/W1980806050","https://openalex.org/W1985635972","https://openalex.org/W2079998848","https://openalex.org/W2112541882","https://openalex.org/W2169528473","https://openalex.org/W2177274602","https://openalex.org/W2264885058","https://openalex.org/W2908310275","https://openalex.org/W3188512042","https://openalex.org/W4300591351","https://openalex.org/W6839914268"],"related_works":["https://openalex.org/W2154794415","https://openalex.org/W2107824370","https://openalex.org/W1500907979","https://openalex.org/W2039577724","https://openalex.org/W2380814829","https://openalex.org/W1551903405","https://openalex.org/W2499946963","https://openalex.org/W2387511021","https://openalex.org/W1531156418","https://openalex.org/W2095048141"],"abstract_inverted_index":{"In":[0,22,157],"robotics":[1],"applications,":[2],"supporting":[3],"navigation":[4,29,43],"in":[5,30,83,92,142],"dynamic":[6],"environments":[7],"(described":[8],"though":[9],"a":[10,31,66,80,109,115,125,160,170,224,246],"graph)":[11,191],"have":[12],"been":[13],"addressed":[14],"multiple":[15],"times":[16],"relying":[17,181],"on":[18,163,182],"very":[19],"different":[20,35],"approaches.":[21],"this":[23,158],"work,":[24],"we":[25],"are":[26],"considering":[27,34,114],"the":[28,53,84,101,122,129,134,143,164,167,177,183,186,206,230,235,241,254],"pre-defined":[32],"map,":[33],"areas":[36],"(rooms)":[37],"connected":[38],"by":[39,46,229],"some":[40,93],"pathways.":[41],"The":[42,58,98,136],"is":[44,61,76,111,174,193,209,219],"constrained":[45],"resource":[47],"availability":[48],"and":[49,69,73,119,201,204,221,227,245],"specific":[50,67,81,140],"conditions":[51],"allowing":[52,121],"movement":[54,123],"between":[55],"adjacent":[56],"areas.":[57],"overall":[59],"goal":[60,208],"to":[62,78,128,150,154,169,195,249],"conclude":[63,196,250],"if,":[64],"given":[65],"map":[68,85,110,168,226],"all":[70],"associated":[71,187,242],"constraints":[72],"resources,":[74],"it":[75,192],"possible":[77,194],"reach":[79],"location":[82,131],"(the":[86],"ultimate":[87,130,207,255],"goal)":[88],"without":[89],"being":[90],"trapped":[91],"deadlock":[94],"or":[95,211],"livelock":[96],"situation.":[97],"validation":[99],"of":[100,117,133,166,185,199,216,253],"proposed":[102],"approach":[103],"uses":[104],"procedurally":[105],"generated":[106,113],"games,":[107],"where":[108],"automatically":[112],"set":[116,215],"rooms":[118],"doors":[120],"from":[124],"starting":[126],"room":[127],"(end":[132],"game).":[135],"player":[137],"may":[138],"collect":[139],"resources":[141],"visited":[144],"rooms,":[145],"which":[146,233],"will":[147],"be":[148],"used":[149],"allow":[151],"navigation,":[152],"namely":[153],"unlock":[155],"passages.":[156],"paper,":[159],"strategy":[161],"based":[162],"translation":[165,217],"Petri":[171,178],"net":[172,179],"model":[173],"proposed.":[175],"From":[176],"model,":[180],"building":[184],"state":[188,243],"space":[189,244],"(reachability":[190],"about":[197,251],"existence":[198],"deadlocks":[200],"loops":[202],"(livelocks)":[203],"if":[205],"reachable":[210],"not.":[212],"A":[213],"minimum":[214],"rules":[218],"presented":[220],"validated":[222],"using":[223],"small":[225],"supported":[228],"IOPT-Tools":[231],"framework,":[232],"provides":[234],"tools":[236],"for":[237],"editing,":[238],"simulating,":[239],"generating":[240],"query":[247],"mechanism":[248],"reachability":[252],"goal,":[256],"as":[257,259],"well":[258],"deadlocks.":[260]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}