{"id":"https://openalex.org/W3007142955","doi":"https://doi.org/10.1109/access.2020.2975114","title":"Constrained Hopping Traversability Analysis on Non-Uniform Polygonal Chains","display_name":"Constrained Hopping Traversability Analysis on Non-Uniform Polygonal Chains","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3007142955","doi":"https://doi.org/10.1109/access.2020.2975114","mag":"3007142955"},"language":"en","primary_location":{"id":"doi:10.1109/access.2020.2975114","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.2975114","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2020.2975114","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051061220","display_name":"Saurabh Upadhyay","orcid":"https://orcid.org/0000-0002-2030-1594"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Saurabh Upadhyay","raw_affiliation_strings":["Department of Aerospace Engineering, University of Bristol, Bristol, U.K"],"raw_orcid":"https://orcid.org/0000-0002-2030-1594","affiliations":[{"raw_affiliation_string":"Department of Aerospace Engineering, University of Bristol, Bristol, U.K","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069883451","display_name":"A. Pedro Aguiar","orcid":"https://orcid.org/0000-0001-7105-0505"},"institutions":[{"id":"https://openalex.org/I182534213","display_name":"Universidade do Porto","ror":"https://ror.org/043pwc612","country_code":"PT","type":"education","lineage":["https://openalex.org/I182534213"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"A. Pedro Aguiar","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Faculty of Engineering, University of Porto (FEUP), Porto, Portugal"],"raw_orcid":"https://orcid.org/0000-0001-7105-0505","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Faculty of Engineering, University of Porto (FEUP), Porto, Portugal","institution_ids":["https://openalex.org/I182534213"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051061220"],"corresponding_institution_ids":["https://openalex.org/I36234482"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.0981,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.36544289,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"8","issue":null,"first_page":"36691","last_page":"36701"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10879","display_name":"Robotic Locomotion and Control","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.6383519172668457},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6254727244377136},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5855826139450073},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5125017166137695},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.48498082160949707},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47866401076316833},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3927614092826843},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.37276583909988403},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2778412103652954},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25872159004211426}],"concepts":[{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.6383519172668457},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6254727244377136},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5855826139450073},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5125017166137695},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.48498082160949707},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47866401076316833},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3927614092826843},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.37276583909988403},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2778412103652954},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25872159004211426},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/access.2020.2975114","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.2975114","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/57559055-af4d-4654-867c-7da398145161","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/57559055-af4d-4654-867c-7da398145161","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Upadhyay, S & Aguiar, A P 2020, 'Constrained Hopping Traversability Analysis on Non-Uniform Polygonal Chains', IEEE Access, vol. 8, 9003191, pp. 36691-36701. https://doi.org/10.1109/ACCESS.2020.2975114","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:3f4d1acf935340628ad0e9c9374930de","is_oa":false,"landing_page_url":"https://doaj.org/article/3f4d1acf935340628ad0e9c9374930de","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 8, Pp 36691-36701 (2020)","raw_type":"article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/57559055-af4d-4654-867c-7da398145161","is_oa":true,"landing_page_url":"https://hdl.handle.net/1983/57559055-af4d-4654-867c-7da398145161","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Upadhyay, S & Aguiar, A P 2020, 'Constrained Hopping Traversability Analysis on Non-Uniform Polygonal Chains', IEEE Access, vol. 8, 9003191, pp. 36691-36701. https://doi.org/10.1109/ACCESS.2020.2975114","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/57559055-af4d-4654-867c-7da398145161","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85081141046&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"doi:10.1109/access.2020.2975114","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.2975114","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6600000262260437,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G274581676","display_name":null,"funder_award_id":"POCI-01","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G3059425546","display_name":null,"funder_award_id":"POCI-01-0145-FEDER-031411","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G3304963357","display_name":null,"funder_award_id":"UIDB/00147/2020","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G3439937706","display_name":null,"funder_award_id":"POCI-01-0145-FEDER-031823","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G3550249319","display_name":null,"funder_award_id":"NORTE 2020","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G4274794432","display_name":null,"funder_award_id":"NORTE-01-0145-FEDER-000033","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G4455079242","display_name":null,"funder_award_id":"POCI-01-","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G491858407","display_name":null,"funder_award_id":"COMPETE2020","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G8884816653","display_name":null,"funder_award_id":"POCI-01-0145-FEDER","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"}],"funders":[{"id":"https://openalex.org/F4320324086","display_name":"Universidade do Porto","ror":"https://ror.org/043pwc612"},{"id":"https://openalex.org/F4320335322","display_name":"European Regional Development Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1777440934","https://openalex.org/W1968984213","https://openalex.org/W2029780844","https://openalex.org/W2053710578","https://openalex.org/W2059435624","https://openalex.org/W2142522221","https://openalex.org/W2170804654","https://openalex.org/W2213465260","https://openalex.org/W2524752696","https://openalex.org/W2526955220","https://openalex.org/W2566141114","https://openalex.org/W2787535343","https://openalex.org/W2883170902","https://openalex.org/W2888574169","https://openalex.org/W2910961611","https://openalex.org/W2910992102","https://openalex.org/W4242811155","https://openalex.org/W6685133251"],"related_works":["https://openalex.org/W3213331859","https://openalex.org/W4226458444","https://openalex.org/W4390637946","https://openalex.org/W4285089922","https://openalex.org/W4226082913","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W1987886368","https://openalex.org/W1660309994"],"abstract_inverted_index":{"We":[0,40],"analyze":[1],"the":[2,57,73,83,91,124],"existence":[3,85],"of":[4,56,111,123],"constrained":[5,20,105],"ballistic":[6],"hopping":[7,106],"paths":[8],"on":[9,90],"a":[10,78,95,133],"nonuniform":[11],"polygonal":[12,92],"chain.":[13,93],"This":[14],"analysis":[15],"has":[16],"practical":[17],"significance":[18],"in":[19,132],"path":[21,84,96,107],"planning":[22],"applications":[23],"for":[24],"jumping":[25,139],"robots":[26],"where":[27],"robot":[28,50,58,138],"dynamic":[29],"constraints,":[30],"uneven":[31],"surface":[32,36],"structure,":[33],"and":[34,64,114,121,142],"non-uniform":[35],"properties":[37],"are":[38,127],"considered.":[39],"derive":[41],"closed-form":[42,74],"conditions":[43],"to":[44,81,101],"satisfy":[45],"<italic":[46,52,59,65],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[47,53,60,66],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i)</i>":[48],"damage-free":[49],"landing":[51],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">ii)</i>":[54],"non-sliding":[55],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">iii)</i>":[61],"actuator":[62],"saturation,":[63],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">iv)</i>":[67],"intermediate":[68,112],"terrain":[69,135],"avoidance":[70],"constraints.":[71],"Using":[72],"conditions,":[75],"we":[76],"propose":[77],"traversability":[79],"algorithm":[80],"determine":[82],"between":[86],"two":[87],"given":[88],"points":[89],"Correspondingly,":[94],"generation":[97],"approach":[98],"is":[99],"discussed":[100],"generate":[102],"an":[103],"optimal":[104],"with":[108,137],"minimum":[109],"number":[110],"hops":[113],"least":[115],"take-off":[116],"speed":[117],"per":[118],"hop.":[119],"Applicability":[120],"viability":[122],"proposed":[125],"algorithms":[126],"demonstrated":[128],"through":[129],"computer":[130],"simulations":[131],"realistic":[134],"scenario":[136],"motion":[140],"uncertainties":[141],"disturbances.":[143]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-05-14T08:36:36.166977","created_date":"2025-10-10T00:00:00"}