{"id":"https://openalex.org/W7135244740","doi":"https://doi.org/10.48550/arxiv.2603.11658","title":"Coupling Tensor Trains with Graph of Convex Sets: Effective Compression, Exploration, and Planning in the C-Space","display_name":"Coupling Tensor Trains with Graph of Convex Sets: Effective Compression, Exploration, and Planning in the C-Space","publication_year":2026,"publication_date":"2026-03-12","ids":{"openalex":"https://openalex.org/W7135244740","doi":"https://doi.org/10.48550/arxiv.2603.11658"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.11658","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11658","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.11658","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129081075","display_name":"Gerhard Reinerth","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Reinerth, Gerhard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078684534","display_name":"Riddhiman Laha","orcid":"https://orcid.org/0000-0001-8527-0445"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Laha, Riddhiman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5074014301","display_name":"Marcello Romano","orcid":"https://orcid.org/0000-0002-6351-6229"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Romano, Marcello","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.3799000084400177,"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.3799000084400177,"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/T12290","display_name":"Human Motion and Animation","score":0.056299999356269836,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.048500001430511475,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.600600004196167},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5938000082969666},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.546500027179718},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5365999937057495},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5145999789237976},{"id":"https://openalex.org/keywords/configuration-space","display_name":"Configuration space","score":0.5013999938964844},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.40630000829696655},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.40389999747276306},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.37549999356269836},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.3734999895095825}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.600600004196167},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5938000082969666},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.546500027179718},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5365999937057495},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5145999789237976},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5060999989509583},{"id":"https://openalex.org/C90738871","wikidata":"https://www.wikidata.org/wiki/Q41642869","display_name":"Configuration space","level":2,"score":0.5013999938964844},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.40630000829696655},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.40389999747276306},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3937000036239624},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.37549999356269836},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.3734999895095825},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36410000920295715},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.358599990606308},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.3513000011444092},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.3472000062465668},{"id":"https://openalex.org/C131584629","wikidata":"https://www.wikidata.org/wiki/Q4308705","display_name":"Coupling (piping)","level":2,"score":0.33799999952316284},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3346000015735626},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3255000114440918},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3248000144958496},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30410000681877136},{"id":"https://openalex.org/C190839683","wikidata":"https://www.wikidata.org/wiki/Q2448197","display_name":"Train","level":2,"score":0.2985999882221222},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C2986737658","wikidata":"https://www.wikidata.org/wiki/Q30103009","display_name":"Tensor decomposition","level":3,"score":0.290800005197525},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C157406716","wikidata":"https://www.wikidata.org/wiki/Q4115842","display_name":"Topological graph theory","level":5,"score":0.27880001068115234},{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.27730000019073486},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C145565327","wikidata":"https://www.wikidata.org/wiki/Q852514","display_name":"Motion control","level":3,"score":0.2703999876976013},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.26840001344680786},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26179999113082886},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.2563999891281128},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.11658","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11658","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.11658","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11658","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"present":[1],"TANGO":[2,68,124],"(Tensor":[3],"ANd":[4],"Graph":[5,33],"Optimization),":[6],"a":[7,50,83,100],"novel":[8],"motion":[9,106,128],"planning":[10,107,129],"framework":[11],"that":[12,60,108],"integrates":[13],"tensor-based":[14,118],"compression":[15,119,160],"with":[16,120],"structured":[17,121],"graph":[18,122],"optimization":[19],"to":[20,76],"enable":[21],"efficient":[22],"and":[23,89,113,130,137,152,161],"scalable":[24,138],"trajectory":[25],"generation.":[26],"While":[27],"optimization-based":[28],"planners":[29],"such":[30],"as":[31],"the":[32,55,78,132],"of":[34,54,91,140,158],"Convex":[35],"Sets":[36],"(GCS)":[37],"offer":[38],"powerful":[39],"tools":[40],"for":[41,64,104,134],"generating":[42],"smooth,":[43],"optimal":[44],"trajectories,":[45],"they":[46],"typically":[47],"rely":[48],"on":[49,150],"predefined":[51],"convex":[52],"characterization":[53],"high-dimensional":[56],"configuration":[57,80,141],"space-a":[58],"requirement":[59],"is":[61],"often":[62],"intractable":[63],"general":[65],"robotic":[66,145],"tasks.":[67],"builds":[69],"further":[70],"by":[71],"using":[72],"Tensor":[73],"Train":[74],"decomposition":[75],"approximate":[77],"feasible":[79],"space":[81,142],"in":[82,143],"compressed":[84],"form,":[85],"enabling":[86],"rapid":[87],"discovery":[88],"estimation":[90],"task-relevant":[92],"regions.":[93],"These":[94],"regions":[95],"are":[96],"then":[97],"embedded":[98],"into":[99],"GCS-like":[101],"structure,":[102],"allowing":[103],"geometry-aware":[105,127],"respects":[109],"both":[110],"system":[111],"constraints":[112],"environmental":[114],"complexity.":[115],"By":[116],"coupling":[117],"reasoning,":[123],"enables":[125],"efficient,":[126],"lays":[131],"groundwork":[133],"more":[135],"expressive":[136],"representations":[139],"future":[144],"systems.":[146],"Rigorous":[147],"simulation":[148],"studies":[149],"planar":[151],"real":[153],"robots":[154],"reinforce":[155],"our":[156],"claims":[157],"effective":[159],"higher":[162],"quality":[163],"trajectories.":[164]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-14T00:00:00"}