{"id":"https://openalex.org/W4415159286","doi":"https://doi.org/10.23919/ecc65951.2025.11187106","title":"Graph-Theoretic B\u00e9zier Curve Optimization over Safe Corridors for Safe and Smooth Motion Planning","display_name":"Graph-Theoretic B\u00e9zier Curve Optimization over Safe Corridors for Safe and Smooth Motion Planning","publication_year":2025,"publication_date":"2025-06-24","ids":{"openalex":"https://openalex.org/W4415159286","doi":"https://doi.org/10.23919/ecc65951.2025.11187106"},"language":"en","primary_location":{"id":"doi:10.23919/ecc65951.2025.11187106","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc65951.2025.11187106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Control Conference (ECC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/d3009271-7bb1-4516-aa22-d21df67e4a6b","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092998260","display_name":"Soufyan Zayou","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Soufyan Zayou","raw_affiliation_strings":["Eind-Hoven University of Technology,Department of Mechanical Engineering,MB Eindhoven,The Netherlands,5600"],"affiliations":[{"raw_affiliation_string":"Eind-Hoven University of Technology,Department of Mechanical Engineering,MB Eindhoven,The Netherlands,5600","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042096409","display_name":"\u00d6m\u00fcr Arslan","orcid":"https://orcid.org/0000-0003-0436-6424"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"\u00d6m\u00fcr Arslan","raw_affiliation_strings":["Eind-Hoven University of Technology,Department of Mechanical Engineering,MB Eindhoven,The Netherlands,5600"],"affiliations":[{"raw_affiliation_string":"Eind-Hoven University of Technology,Department of Mechanical Engineering,MB Eindhoven,The Netherlands,5600","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5092998260"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":2.343,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.90519763,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1364","last_page":"1371"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9979000091552734,"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.9979000091552734,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9853000044822693,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T14270","display_name":"Simulation and Modeling Applications","score":0.9821000099182129,"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/optimization-problem","display_name":"Optimization problem","score":0.5889000296592712},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.4814000129699707},{"id":"https://openalex.org/keywords/quadratic-function","display_name":"Quadratic function","score":0.4749999940395355},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.45590001344680786},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.44920000433921814},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.4458000063896179},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.39489999413490295},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.3856000006198883},{"id":"https://openalex.org/keywords/shape-optimization","display_name":"Shape optimization","score":0.3817000091075897},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.3677999973297119}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6646000146865845},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5889000296592712},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.4814000129699707},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.4749999940395355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4747999906539917},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.45590001344680786},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.44920000433921814},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.4458000063896179},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41749998927116394},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.39489999413490295},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.3856000006198883},{"id":"https://openalex.org/C29513896","wikidata":"https://www.wikidata.org/wiki/Q7489239","display_name":"Shape optimization","level":3,"score":0.3817000091075897},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.3677999973297119},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.36559998989105225},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3569999933242798},{"id":"https://openalex.org/C145565327","wikidata":"https://www.wikidata.org/wiki/Q852514","display_name":"Motion control","level":3,"score":0.3515999913215637},{"id":"https://openalex.org/C150185637","wikidata":"https://www.wikidata.org/wiki/Q7705773","display_name":"Test functions for optimization","level":4,"score":0.34459999203681946},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.3434999883174896},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.3303999900817871},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33000001311302185},{"id":"https://openalex.org/C184389593","wikidata":"https://www.wikidata.org/wiki/Q603159","display_name":"Curve fitting","level":2,"score":0.31859999895095825},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.3061999976634979},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.30070000886917114},{"id":"https://openalex.org/C29282572","wikidata":"https://www.wikidata.org/wiki/Q16977029","display_name":"Derivative-free optimization","level":4,"score":0.2946999967098236},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.29269999265670776},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.2883000075817108},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2854999899864197},{"id":"https://openalex.org/C99636146","wikidata":"https://www.wikidata.org/wiki/Q35889","display_name":"Parametric equation","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C39920418","wikidata":"https://www.wikidata.org/wiki/Q11476","display_name":"Kinematics","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C150415221","wikidata":"https://www.wikidata.org/wiki/Q40687","display_name":"Robotic arm","level":2,"score":0.265500009059906},{"id":"https://openalex.org/C95020103","wikidata":"https://www.wikidata.org/wiki/Q1813492","display_name":"Match moving","level":3,"score":0.2540999948978424}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.23919/ecc65951.2025.11187106","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc65951.2025.11187106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Control Conference (ECC)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire/d3009271-7bb1-4516-aa22-d21df67e4a6b","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/d3009271-7bb1-4516-aa22-d21df67e4a6b","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zayou, S & Arslan, \u00d6 2025, Graph-Theoretic B\u00e9zier Curve Optimization over Safe Corridors for Safe and Smooth Motion Planning. in 2025 European Control Conference, ECC., 11187106, Institute of Electrical and Electronics Engineers, pp. 1364-1371, 23rd European Control Conference 2025, Thessaloniki, Greece, 24/06/25. https://doi.org/10.23919/ECC65951.2025.11187106","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/d3009271-7bb1-4516-aa22-d21df67e4a6b","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/d3009271-7bb1-4516-aa22-d21df67e4a6b","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zayou, S & Arslan, \u00d6 2025, Graph-Theoretic B\u00e9zier Curve Optimization over Safe Corridors for Safe and Smooth Motion Planning. in 2025 European Control Conference, ECC., 11187106, Institute of Electrical and Electronics Engineers, pp. 1364-1371, 23rd European Control Conference 2025, Thessaloniki, Greece, 24/06/25. https://doi.org/10.23919/ECC65951.2025.11187106","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1030513622","https://openalex.org/W1993282304","https://openalex.org/W2057799302","https://openalex.org/W2073330885","https://openalex.org/W2076383834","https://openalex.org/W2128949346","https://openalex.org/W2151104204","https://openalex.org/W2152536965","https://openalex.org/W2160643434","https://openalex.org/W2162991084","https://openalex.org/W2291160178","https://openalex.org/W2306644740","https://openalex.org/W2414314951","https://openalex.org/W2482392012","https://openalex.org/W2561780869","https://openalex.org/W2564091245","https://openalex.org/W2587415290","https://openalex.org/W2732510496","https://openalex.org/W2772321112","https://openalex.org/W2886374915","https://openalex.org/W2891392570","https://openalex.org/W2891491652","https://openalex.org/W2903506349","https://openalex.org/W2962787639","https://openalex.org/W2962963952","https://openalex.org/W2963215357","https://openalex.org/W2969306559","https://openalex.org/W2983729545","https://openalex.org/W3016376668","https://openalex.org/W3209325542","https://openalex.org/W4288064626","https://openalex.org/W4323797458"],"related_works":[],"abstract_inverted_index":{"As":[0],"a":[1,80,93,117,161],"parametric":[2],"motion":[3,18,217],"representation,":[4],"B\u00e9zier":[5,36,71,88,97,121,150,176,179,194,210],"curves":[6,177],"have":[7],"significant":[8],"applications":[9],"in":[10],"polynomial":[11],"trajectory":[12],"optimization":[13,38,41,53,69,90,114,130,146,152,174,206],"for":[14,84,172],"safe":[15,156],"and":[16,29,62,86,128,140,187,200,205],"smooth":[17],"planning":[19],"of":[20,35,70,96,175,189,193],"various":[21],"robotic":[22,30],"systems,":[23],"including":[24],"flying":[25],"drones,":[26],"autonomous":[27],"vehicles,":[28],"manipulators.":[31],"An":[32],"essential":[33],"component":[34],"curve":[37,72,89,151],"is":[39],"the":[40,47,185,190],"objective,":[42],"as":[43,56,132],"it":[44],"significantly":[45],"influences":[46],"resulting":[48],"robot":[49,216],"motion.":[50],"Standard":[51],"physical":[52,113],"objectives,":[54,147],"such":[55],"minimizing":[57],"total":[58],"velocity,":[59],"acceleration,":[60],"jerk,":[61],"snap,":[63],"are":[64],"known":[65],"to":[66,109,198,209],"yield":[67],"quadratic":[68,173],"control":[73,98,122,195],"points.":[74],"In":[75,107],"this":[76],"paper,":[77],"we":[78,124,148],"present":[79],"unifying":[81],"graph-theoretic":[82],"perspective":[83],"defining":[85],"understanding":[87],"objectives":[91,115,131,207],"using":[92,137,178],"consensus":[94,118,134],"distance":[95,119],"points":[99,196],"derived":[100],"based":[101],"on":[102],"their":[103],"interaction":[104,203],"graph":[105],"Laplacian.":[106],"addition":[108],"demonstrating":[110],"how":[111],"standard":[112],"define":[116],"between":[120],"points,":[123],"also":[125],"introduce":[126],"geometric":[127],"statistical":[129],"alternative":[133],"distances,":[135],"constructed":[136,159],"finite":[138,191],"differencing":[139],"differential":[141],"variance.":[142],"To":[143],"compare":[144],"these":[145],"apply":[149],"over":[153],"convex":[154],"polygonal":[155],"corridors":[157],"automatically":[158],"around":[160],"maximal-clearance":[162],"minimal-length":[163],"reference":[164],"path.":[165],"We":[166,182],"provide":[167],"an":[168],"explicit":[169],"analytical":[170],"formulation":[171],"matrix":[180],"operations.":[181],"conclude":[183],"that":[184],"norm":[186],"variance":[188],"differences":[192],"lead":[197],"simpler":[199],"more":[201],"intuitive":[202],"graphs":[204],"compared":[208],"derivative":[211],"norms,":[212],"despite":[213],"having":[214],"similar":[215],"profiles.":[218]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-18T07:56:08.524223","created_date":"2025-10-14T00:00:00"}