Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-06T17:30:49.990716Z
Paper Citation Record · LEDGER
As of 9 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 1 inbound Pith citation observation for arXiv:2507.10878.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-06T17:30:49.990716Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-07-02T11:55:26.547792Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-02T11:56:54.804493Z
63 of 63 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation 4b4d0326-8406-4b98-aa4f-3c65b72b14d3 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets The MOSEK optimization toolbox for MATLAB manual
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 6eca924f-aa4d-46a5-b2ef-62392d04bb59 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Generation of collision-free trajectories for a quadrocopter fleet: A sequential convex programming approach
Reference 2
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation e729f5ff-e417-4f94-a319-f3ffc443b55d · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Control of systems integrating logic, dynamics, and constraints
Reference 3
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation b264226e-6a7b-497f-9377-9425922159b5 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Survey of numerical methods for trajectory optimization
Reference 4
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 227b173e-87b6-4475-8ba8-67712126f3dc · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Semidefinite optimization and convex algebraic geometry
Reference 5
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 763579bc-6ec5-4971-8398-7061f61c40b7 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Sequential composition of dynamically dexterous robot behaviors
Reference 6
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 8b632e82-a0e1-46dd-b652-d4407d7c6a52 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets A hybrid approach to intricate motion, manipulation and task planning
Reference 7
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 8889b036-c53f-4814-8adc-e0aa1e718f5e · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets
Reference 8
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5fe1a549-7230-4bca-b9c8-32d3840f0386 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Non-Euclidean motion planning with graphs of geodesically-convex sets
Reference 9
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 16e4d39d-5331-46f0-8353-6e69f58c43f0 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Footstep planning on uneven terrain with mixed-integer convex optimization
Reference 10
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 43f90427-040d-4cc0-b94c-e4c3dd5a4747 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Computing large con- vex regions of obstacle-free space through semidefinite programming
Reference 11
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 1a99d44f-6e86-47c0-b38d-38cb305e22a4 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Efficient mixed-integer planning for uavs in cluttered environments
Reference 12
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation a1c3e38a-eda4-409e-9b21-18d94f07ae67 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Sampling-based robot motion planning: A review
Reference 13
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 20aa68ed-c980-4ec2-9733-dc680bd763c2 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Scottyactivity: Mixed discrete-continuous plan- ning with convex optimization
Reference 14
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation b7a7aff8-f036-4320-975d-fd54399eb74d · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets PDDLStream: Integrating symbolic planners and blackbox samplers via optimistic adaptive planning
Reference 15
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation a1e77d6c-cb2a-46a3-b612-47fb9f4d5401 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Integrated task and motion plan- ning
Reference 16
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 3a2aea0a-fb1b-4127-9b33-1238129535c9 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets SNOPT: An SQP algorithm for large-scale constrained optimization
Reference 17
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 06eb6d7c-e36b-4708-939e-93971bc93bbe · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Optimal sampling-based planning for linear-quadratic kinodynamic systems
Reference 18
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 8d3fac38-5f3f-4821-bff5-9203aaf2ab72 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Towards tight convex relaxations for contact-rich manipulation
Reference 19
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 8b5eba9c-5819-43d2-b9a0-e741dfa2df05 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Sequential quadratic programming for task plan optimization
Reference 20
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 8ec3f370-9f43-45ba-b50a-fe6a191a0aaf · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions
Reference 21
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation cd820225-f887-444b-9183-22ae11006c99 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Hierar- chical task and motion planning in the now
Reference 22
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation b801821a-0bb2-4f65-bd2f-135ba36923ab · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Biped walking pattern generation by using preview control of zero-moment point
Reference 23
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation a9a5ab5f-cd33-46e7-a818-8738c9364ef5 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Sampling-based al- gorithms for optimal motion planning
Reference 24
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 67742df6-d1a5-499d-a943-c6654a2cb457 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Reducibility among combinatorial problems
Reference 25
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 16c45a33-47b8-41d7-b3b2-6bfaf559bd1a · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Reference 26
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation d09f731d-2820-4adb-9f16-5e489b0dad09 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Skill discovery in continuous reinforcement learning domains using skill chaining
Reference 27
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation ba97f83f-e99f-4eaf-8c0f-43a8e1be81f3 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Efficiently solving general rearrangement tasks: A fast extension primitive for an incremental sampling-based planner
Reference 28
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 5c6ea0ea-d196-445d-a771-62e825be11db · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Temporal logic motion plan- ning with convex optimization via graphs of convex sets
Reference 29
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 2e396d06-b513-498d-ab5b-32d75855eaee · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Global optimization with polynomials and the problem of moments
Reference 30
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 748a2717-8197-4c50-9d47-b3a92b5d0096 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Rapidly-exploring random trees: A new tool for path planning
Reference 31
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 5f524d1f-a066-4953-815d-8c2fa742ce17 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Strong Formulations for Hybrid System Control
Reference 32
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 66cc5d66-e7fc-4b28-ab7a-6967c86cd8fe · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Funnel libraries for real-time robust feedback motion planning
Reference 33
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 52196996-9ecc-4115-b35f-f7b4dbcb74e2 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Graphs of Convex Sets with Applications to Optimal Control and Motion Planning
Reference 34
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 4b1c9621-021d-4066-8abf-20ef443dc893 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Motion planning around obstacles with convex optimization
Reference 35
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation c6469625-8cf7-4486-8e14-64a87b1ac11c · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Fast path planning through large collections of safe boxes
Reference 36
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation a90d38ff-6417-44cc-8458-d66c68d3ea26 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Shortest paths in graphs of convex sets
Reference 37
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation c09c7c2a-d3b1-49c7-b144-15dfc5be174b · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Mixed-integer quadratic program trajectory generation for heterogeneous quadrotor teams
Reference 38
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation f9d04de3-1f13-40d3-9f7c-aaf6277d1533 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Multi-Query Shortest-Path Problem in Graphs of Convex Sets
Reference 39
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation cfc57827-1c77-4832-bb39-f2553b265562 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Implicit Graph Search for Planning on Graphs of Convex Sets
Reference 40
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5c9d15bb-33d3-402e-a9bf-4e42059fd837 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Structured semidefinite programs and semialgebraic geometry methods in robustness and opti- mization
Reference 41
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 6d1ecabb-6807-49d0-8d06-b1195e21c5b7 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Semidefinite programming relaxations for semialgebraic problems
Reference 42
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 4afa6d17-af70-4062-bb17-95440c6a7a69 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Growing Convex Collision-Free Regions in Configuration Space using Nonlinear Programming
Reference 43
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0bceb8b5-d3e6-4053-b911-f302c00e9b27 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets
Reference 44
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 02cd205f-4962-4715-98bf-11894ed6ceb4 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Aircraft tra- jectory planning with collision avoidance using mixed integer linear programming
Reference 45
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation af1c0cac-d7eb-46f1-bf44-c69287789815 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Mixed integer programming for multi- vehicle path planning
Reference 46
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 74e801a3-afc0-414e-b080-eddb427066d6 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Motion planning with sequential convex optimization and convex colli- sion checking
Reference 47
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation dbe24796-7dd2-4cbb-bb93-60ac11735a17 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets SMC: Satisfiability modulo convex program- ming
Reference 48
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 6f0d5464-7933-4b97-8ba4-ecb310d138f7 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Nonlinear regulation: The piecewise linear approach
Reference 49
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 1dff30c4-d9b0-4c7f-a97b-5d42eb65f614 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Interconnected automata and linear systems: A theoretical framework in discrete-time
Reference 50
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 9c64c71f-1cda-4cd4-a6af-585151ae908f · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Combined task and motion planning through an extensible planner- independent interface layer
Reference 51
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 06c0ae8a-c1cb-4eb8-8a31-aae7a7c3f156 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets $A^*$ for Graphs of Convex Sets
Reference 52
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3107d9d7-c28f-4919-b641-cc1c2265c5a5 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Between MDPs and semi-MDPs: A framework for tem- poral abstraction in reinforcement learning
Reference 53
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 5c616e5d-dc76-4849-8f2c-9e6307dc0321 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets LQR-trees: Feedback motion plan- ning on sparse randomized trees
Reference 54
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation a6cc794c-36c6-4e73-a4d0-ac108ccc8c16 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Logic-geometric programming: An optimization-based approach to combined task and mo- tion planning
Reference 55
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation d3b33eb0-08bf-466a-9399-408fac7933fa · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Time-optimal path tracking for robots: A convex optimization approach
Reference 56
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation fc73d427-d685-4291-a642-8e02252f405c · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Using graphs of convex sets to guide nonconvex trajectory optimiza- tion
Reference 57
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 04e59d58-88b7-4c13-9544-9538e613b8e0 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Zero- moment point—thirty five years of its life
Reference 58
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b9b2a770-8f26-4cae-9cc0-f03a2f1d1937 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Kinody- namic RRT*: Asymptotically optimal motion planning for robots with linear dynamics
Reference 59
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation efae06d5-74b4-4b6e-83ac-07f3f86938ab · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Approximating robot configura- tion spaces with few convex sets using clique covers of visibility graphs
Reference 60
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation bcb972c7-cf6e-4870-9ce3-4bed143cba18 · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space
Reference 61
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5725ae6d-a4d3-49b3-9032-84949f73addb · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets R3T: Rapidly-exploring random reachable set tree for optimal kinodynamic planning of nonlinear hybrid systems
Reference 62
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 182abb6a-2f61-4317-89d7-94a7b81a536e · outbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Optimization-based collision avoidance
Reference 63
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 4677e346-0f88-46a7-90cf-adbf8196c61d · inbound
Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets
Reference 25
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.