Pith. sign in

Paper Citation Record · LEDGER

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets

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.

pith.paper-citation-record.v1
2507.10878 v1

Coverage vector

measured 63 of 63 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T17:30:49.990716Z

measured 64 of 64 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-07-02T11:55:26.547792Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-07-02T11:56:54.804493Z

Reference resolution

63 of 63 outbound references displayed

  • verified exact2
  • verified fuzzy52
  • unresolved8
  • parse uncertain0
  • malformed identifier1
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 4b4d0326-8406-4b98-aa4f-3c65b72b14d3 · outbound

This paper cites The MOSEK optimization toolbox for MATLAB manual.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets The MOSEK optimization toolbox for MATLAB manual

Reference 1

Resolution
malformed identifier
raw_fallback, observed 2026-08-06T17:30:51.921314Z

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.

source=pdf_text observed=2026-08-06T17:30:45.012518Z digest=sha256:c9ce34ee656b3f235e32c93fda6f37f388e0d50346a2bfb0fb30d869ff17d44c

Observation 6eca924f-aa4d-46a5-b2ef-62392d04bb59 · outbound

This paper cites Generation of collision-free trajectories for a quadrocopter fleet: A sequential convex programming approach.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.911221Z

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.

source=pdf_text observed=2026-08-06T17:30:45.083989Z digest=sha256:0d07808473c962f5340bddd2ea6466406e668d04160ed8a87328fda0453dbc37

Observation e729f5ff-e417-4f94-a319-f3ffc443b55d · outbound

This paper cites Control of systems integrating logic, dynamics, and constraints.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Control of systems integrating logic, dynamics, and constraints

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.902191Z

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.

source=pdf_text observed=2026-08-06T17:30:45.186531Z digest=sha256:9ce8ed1f0e9a11a53e3b1b5b21dc20bbf78c87dd14940d763071c3444f8f471d

Observation b264226e-6a7b-497f-9377-9425922159b5 · outbound

This paper cites Survey of numerical methods for trajectory optimization.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Survey of numerical methods for trajectory optimization

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.892778Z

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.

source=pdf_text observed=2026-08-06T17:30:45.282000Z digest=sha256:100f11c7c459d7bcbac5050d3ca382c8dc885fa8a8fb5aa2281d214e452a56a2

Observation 227b173e-87b6-4475-8ba8-67712126f3dc · outbound

This paper cites Semidefinite optimization and convex algebraic geometry.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Semidefinite optimization and convex algebraic geometry

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.883320Z

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.

source=pdf_text observed=2026-08-06T17:30:45.358257Z digest=sha256:621427a80483adc7d7d5e6af2c9129d730ae28d84945f0ef103f9098c5df702c

Observation 763579bc-6ec5-4971-8398-7061f61c40b7 · outbound

This paper cites Sequential composition of dynamically dexterous robot behaviors.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Sequential composition of dynamically dexterous robot behaviors

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.873300Z

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.

source=pdf_text observed=2026-08-06T17:30:45.430048Z digest=sha256:6717c6386e73f4a8992249b2b28b3f38e2e47f0ae57dab3f7a4d7e427fe4acb3

Observation 8b632e82-a0e1-46dd-b652-d4407d7c6a52 · outbound

This paper cites A hybrid approach to intricate motion, manipulation and task planning.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.863706Z

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.

source=pdf_text observed=2026-08-06T17:30:45.523497Z digest=sha256:7036ded0811dbe55044cff21b1fd40e98439d185865070bb09215544aa466222

Observation 8889b036-c53f-4814-8adc-e0aa1e718f5e · outbound

This paper cites GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets.

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

Resolution
unresolved
no resolver link, observed 2026-08-06T17:30:45.587408Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T17:30:45.587408Z digest=sha256:4f8dc74dbcd2cda0eeaa273c6795883cd0bfcbefc28c6abf9443f821f5623179

Observation 5fe1a549-7230-4bca-b9c8-32d3840f0386 · outbound

This paper cites Non-Euclidean motion planning with graphs of geodesically-convex sets.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.854262Z

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.

source=pdf_text observed=2026-08-06T17:30:45.689501Z digest=sha256:aa556f4d5134a60bbffca7f46fdec10cc14aee982c136a2c8f9b411673ae4af5

Observation 16e4d39d-5331-46f0-8353-6e69f58c43f0 · outbound

This paper cites Footstep planning on uneven terrain with mixed-integer convex optimization.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.844811Z

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.

source=pdf_text observed=2026-08-06T17:30:45.751659Z digest=sha256:6a5b0bd47e8554957ceb331fd79cb0427e4c4e803937ffa028d891ce759ba64a

Observation 43f90427-040d-4cc0-b94c-e4c3dd5a4747 · outbound

This paper cites Computing large con- vex regions of obstacle-free space through semidefinite programming.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.834731Z

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.

source=pdf_text observed=2026-08-06T17:30:45.830957Z digest=sha256:cf9cf12dd36a0f60fbead76781694f71b6a5c1b834a78a5d218793791e9e7609

Observation 1a99d44f-6e86-47c0-b38d-38cb305e22a4 · outbound

This paper cites Efficient mixed-integer planning for uavs in cluttered environments.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Efficient mixed-integer planning for uavs in cluttered environments

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.825042Z

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.

source=pdf_text observed=2026-08-06T17:30:45.926277Z digest=sha256:b51dcbbefec4866f23ae209e6d2b699b5d990e988f07e3a5dac66ba61e402ffd

Observation a1c3e38a-eda4-409e-9b21-18d94f07ae67 · outbound

This paper cites Sampling-based robot motion planning: A review.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Sampling-based robot motion planning: A review

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.815110Z

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.

source=pdf_text observed=2026-08-06T17:30:45.965413Z digest=sha256:66656c33059ffc67ca6dfde07adcad48abd07dafe5f6dafcde1b01fe9c857a86

Observation 20aa68ed-c980-4ec2-9733-dc680bd763c2 · outbound

This paper cites Scottyactivity: Mixed discrete-continuous plan- ning with convex optimization.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Scottyactivity: Mixed discrete-continuous plan- ning with convex optimization

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.804888Z

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.

source=pdf_text observed=2026-08-06T17:30:46.011715Z digest=sha256:373432463a02aae5b2151bbd636dfc680356104bd86dad4d6032dda1ccd1d8ca

Observation b7a7aff8-f036-4320-975d-fd54399eb74d · outbound

This paper cites PDDLStream: Integrating symbolic planners and blackbox samplers via optimistic adaptive planning.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.795384Z

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.

source=pdf_text observed=2026-08-06T17:30:46.058305Z digest=sha256:9a763cff92442af934b6d553700b75bcb38aee48a40804732ea12ee95bf2c5f1

Observation a1e77d6c-cb2a-46a3-b612-47fb9f4d5401 · outbound

This paper cites Integrated task and motion plan- ning.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Integrated task and motion plan- ning

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.785308Z

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.

source=pdf_text observed=2026-08-06T17:30:46.095945Z digest=sha256:38a3d877078fa0a47a76036191bc897cf5d23dfa5017953b51ed0e1932df780d

Observation 3a2aea0a-fb1b-4127-9b33-1238129535c9 · outbound

This paper cites SNOPT: An SQP algorithm for large-scale constrained optimization.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets SNOPT: An SQP algorithm for large-scale constrained optimization

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.774519Z

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.

source=pdf_text observed=2026-08-06T17:30:46.148135Z digest=sha256:ff8d1433d3a96665683ffdc06dbc02e982d7e78acff073aa824b401fb0a220ef

Observation 06eb6d7c-e36b-4708-939e-93971bc93bbe · outbound

This paper cites Optimal sampling-based planning for linear-quadratic kinodynamic systems.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Optimal sampling-based planning for linear-quadratic kinodynamic systems

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.763365Z

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.

source=pdf_text observed=2026-08-06T17:30:46.237689Z digest=sha256:8f6590f3c6ed6baf11701a635a0cfa3e4fa4bb8829f12546361c4881990e385b

Observation 8d3fac38-5f3f-4821-bff5-9203aaf2ab72 · outbound

This paper cites Towards tight convex relaxations for contact-rich manipulation.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Towards tight convex relaxations for contact-rich manipulation

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.752145Z

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.

source=pdf_text observed=2026-08-06T17:30:46.345563Z digest=sha256:582a64dc6aeef5f23e15b041d65136df27d7e7a643ecc85c76e8b182e9957a24

Observation 8b5eba9c-5819-43d2-b9a0-e741dfa2df05 · outbound

This paper cites Sequential quadratic programming for task plan optimization.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Sequential quadratic programming for task plan optimization

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.740763Z

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.

source=pdf_text observed=2026-08-06T17:30:46.457780Z digest=sha256:722522aa5d14e79dad3b64072f1906e30e315dbcaa3994dfb7beca5a76d01c84

Observation 8ec3f370-9f43-45ba-b50a-fe6a191a0aaf · outbound

This paper cites Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.730158Z

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.

source=pdf_text observed=2026-08-06T17:30:46.519932Z digest=sha256:6cc96d53d52445fe9ce3e9e484177edc012dd150bbf7ca9cd7d50f0dfeef0b45

Observation cd820225-f887-444b-9183-22ae11006c99 · outbound

This paper cites Hierar- chical task and motion planning in the now.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Hierar- chical task and motion planning in the now

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.719417Z

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.

source=pdf_text observed=2026-08-06T17:30:46.604940Z digest=sha256:8a53531568998b8f4bf427fe36ccc7f3f2badb0be3f203705c0dc941f46ce006

Observation b801821a-0bb2-4f65-bd2f-135ba36923ab · outbound

This paper cites Biped walking pattern generation by using preview control of zero-moment point.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.708725Z

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.

source=pdf_text observed=2026-08-06T17:30:46.729946Z digest=sha256:949b7f7474a9eb02bd5501666054440453436e0f8f052a197abfec004671250b

Observation a9a5ab5f-cd33-46e7-a818-8738c9364ef5 · outbound

This paper cites Sampling-based al- gorithms for optimal motion planning.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Sampling-based al- gorithms for optimal motion planning

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.697926Z

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.

source=pdf_text observed=2026-08-06T17:30:46.799130Z digest=sha256:a3b2eeb775e8fd40b8fcfe1202cc69bc7797a612680639200567b0002df861c2

Observation 67742df6-d1a5-499d-a943-c6654a2cb457 · outbound

This paper cites Reducibility among combinatorial problems.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Reducibility among combinatorial problems

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-06T17:30:46.878201Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T17:30:46.878201Z digest=sha256:474bfa19bbac76f9d00ed37c7c598db56ea16c8e12e52a8f77cd21a205e72fa8

Observation 16c45a33-47b8-41d7-b3b2-6bfaf559bd1a · outbound

This paper cites Probabilistic roadmaps for path planning in high-dimensional configuration spaces.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.679893Z

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.

source=pdf_text observed=2026-08-06T17:30:46.952024Z digest=sha256:fac9a30a958e1c0d9a6c973c48ed24477fbe304b5336dae5bf62681d3223c4ce

Observation d09f731d-2820-4adb-9f16-5e489b0dad09 · outbound

This paper cites Skill discovery in continuous reinforcement learning domains using skill chaining.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.669260Z

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.

source=pdf_text observed=2026-08-06T17:30:47.004867Z digest=sha256:79da533150961fb39586fdbf80485999f9d5d6af6d3c9ef31f0ad712327faf8e

Observation ba97f83f-e99f-4eaf-8c0f-43a8e1be81f3 · outbound

This paper cites Efficiently solving general rearrangement tasks: A fast extension primitive for an incremental sampling-based planner.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.657915Z

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.

source=pdf_text observed=2026-08-06T17:30:47.104237Z digest=sha256:65d4581b85ca613047548c6b1f1591bb8f523313c97c9fd8ae94a78e44248953

Observation 5c6ea0ea-d196-445d-a771-62e825be11db · outbound

This paper cites Temporal logic motion plan- ning with convex optimization via graphs of convex sets.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.647420Z

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.

source=pdf_text observed=2026-08-06T17:30:47.192530Z digest=sha256:bb486adaecf83e05478ee495e308cab5cbe9e0eb9c9482ea78b464d0661d93ff

Observation 2e396d06-b513-498d-ab5b-32d75855eaee · outbound

This paper cites Global optimization with polynomials and the problem of moments.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Global optimization with polynomials and the problem of moments

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.636150Z

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.

source=pdf_text observed=2026-08-06T17:30:47.273996Z digest=sha256:4e6713c15529b80c6c2240fcc3cdb0cc5445f9ca4c1336daa1e181503f3a33cf

Observation 748a2717-8197-4c50-9d47-b3a92b5d0096 · outbound

This paper cites Rapidly-exploring random trees: A new tool for path planning.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.626986Z

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.

source=pdf_text observed=2026-08-06T17:30:47.355703Z digest=sha256:869bfd648cb373f710faf6b31a32280f200ae86afe33f17589f6fc8b65c9e337

Observation 5f524d1f-a066-4953-815d-8c2fa742ce17 · outbound

This paper cites Strong Formulations for Hybrid System Control.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Strong Formulations for Hybrid System Control

Reference 32

Resolution
verified exact
local_arxiv, observed 2026-08-06T17:30:50.514488Z

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.

source=pdf_text observed=2026-08-06T17:30:47.425465Z digest=sha256:b2358758185383a2fee759c585eed03a314dea0aed932c05b2ec36b5b43074be

Observation 66cc5d66-e7fc-4b28-ab7a-6967c86cd8fe · outbound

This paper cites Funnel libraries for real-time robust feedback motion planning.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Funnel libraries for real-time robust feedback motion planning

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.616849Z

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.

source=pdf_text observed=2026-08-06T17:30:47.491813Z digest=sha256:8a48b75076db4118d0f79b9d63e12714b3b284c58f34b6b181571f5eb2718d2e

Observation 52196996-9ecc-4115-b35f-f7b4dbcb74e2 · outbound

This paper cites Graphs of Convex Sets with Applications to Optimal Control and Motion Planning.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.606780Z

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.

source=pdf_text observed=2026-08-06T17:30:47.560037Z digest=sha256:bb05d833dde134ff6e7b614de0a13caa9133d103a52399c3c0bf01e8fa4036f0

Observation 4b1c9621-021d-4066-8abf-20ef443dc893 · outbound

This paper cites Motion planning around obstacles with convex optimization.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Motion planning around obstacles with convex optimization

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.597553Z

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.

source=pdf_text observed=2026-08-06T17:30:47.634490Z digest=sha256:a25dc7ce882fe08efc1160a67bd6146d7da240c3bba46bb52109742f32373e11

Observation c6469625-8cf7-4486-8e14-64a87b1ac11c · outbound

This paper cites Fast path planning through large collections of safe boxes.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Fast path planning through large collections of safe boxes

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.588119Z

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.

source=pdf_text observed=2026-08-06T17:30:47.707370Z digest=sha256:9cf9f72a4a164593c535b0c1d12f580bb92986cbbb28e6969a5645e2cdce1446

Observation a90d38ff-6417-44cc-8458-d66c68d3ea26 · outbound

This paper cites Shortest paths in graphs of convex sets.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Shortest paths in graphs of convex sets

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.578873Z

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.

source=pdf_text observed=2026-08-06T17:30:47.788796Z digest=sha256:3c55e63e0a33b83f7788fe322f01dc82715756559b2df2d9270dd5c14166f040

Observation c09c7c2a-d3b1-49c7-b144-15dfc5be174b · outbound

This paper cites Mixed-integer quadratic program trajectory generation for heterogeneous quadrotor teams.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.569685Z

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.

source=pdf_text observed=2026-08-06T17:30:47.883964Z digest=sha256:54104bec9363168c3b52e9d22c051152ba4a3b491fdfd8f18d53342c3df661ce

Observation f9d04de3-1f13-40d3-9f7c-aaf6277d1533 · outbound

This paper cites Multi-Query Shortest-Path Problem in Graphs of Convex Sets.

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

Resolution
unresolved
no resolver link, observed 2026-08-06T17:30:47.976094Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T17:30:47.976094Z digest=sha256:de80b76cede02db0aa5345c33d228f3331302f461c920656dbb985d8b2c62895

Observation cfc57827-1c77-4832-bb39-f2553b265562 · outbound

This paper cites Implicit Graph Search for Planning on Graphs of Convex Sets.

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

Resolution
unresolved
no resolver link, observed 2026-08-06T17:30:48.050028Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T17:30:48.050028Z digest=sha256:7f43c46c026a3f7d25432e5614d5f708785588df27a4756a6d710b8fd8884c23

Observation 5c9d15bb-33d3-402e-a9bf-4e42059fd837 · outbound

This paper cites Structured semidefinite programs and semialgebraic geometry methods in robustness and opti- mization.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.559800Z

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.

source=pdf_text observed=2026-08-06T17:30:48.153775Z digest=sha256:a64bad4e5abc47644aa1b16a305bcdf594d02158b421d11bdd081ba9b184574d

Observation 6d1ecabb-6807-49d0-8d06-b1195e21c5b7 · outbound

This paper cites Semidefinite programming relaxations for semialgebraic problems.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Semidefinite programming relaxations for semialgebraic problems

Reference 42

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.549797Z

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.

source=pdf_text observed=2026-08-06T17:30:48.227477Z digest=sha256:71fd3adc5f7dd1352fcea2bf32ceea6e62c4bfb86d10e240cdf409c8592e5411

Observation 4afa6d17-af70-4062-bb17-95440c6a7a69 · outbound

This paper cites Growing Convex Collision-Free Regions in Configuration Space using Nonlinear Programming.

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

Resolution
unresolved
no resolver link, observed 2026-08-06T17:30:48.300220Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T17:30:48.300220Z digest=sha256:4c3b4e93675c686c582709944a34cd6927caa6a5607d548e475e918c4422f618

Observation 0bceb8b5-d3e6-4053-b911-f302c00e9b27 · outbound

This paper cites A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets.

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

Resolution
verified exact
local_arxiv, observed 2026-08-06T17:30:50.264462Z

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.

source=pdf_text observed=2026-08-06T17:30:48.397173Z digest=sha256:e0e21c712343273a3f94af9039ac8546ebade7ec75704d8e72293889e33c3863

Observation 02cd205f-4962-4715-98bf-11894ed6ceb4 · outbound

This paper cites Aircraft tra- jectory planning with collision avoidance using mixed integer linear programming.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.540240Z

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.

source=pdf_text observed=2026-08-06T17:30:48.498622Z digest=sha256:584cffdafab38bf6ddbeb6b215c6067de20bd45d6a50ab2b94a178667a981c6c

Observation af1c0cac-d7eb-46f1-bf44-c69287789815 · outbound

This paper cites Mixed integer programming for multi- vehicle path planning.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Mixed integer programming for multi- vehicle path planning

Reference 46

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.530634Z

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.

source=pdf_text observed=2026-08-06T17:30:48.570814Z digest=sha256:cdbb45002ff3aef6edf9f0be98756946912e255e33ff943364ae9a4ebe4caa2b

Observation 74e801a3-afc0-414e-b080-eddb427066d6 · outbound

This paper cites Motion planning with sequential convex optimization and convex colli- sion checking.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.521038Z

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.

source=pdf_text observed=2026-08-06T17:30:48.643319Z digest=sha256:38917c2ab2a8c21971b3a0e426aa92f9c580868945a133d08ee9cba81164da67

Observation dbe24796-7dd2-4cbb-bb93-60ac11735a17 · outbound

This paper cites SMC: Satisfiability modulo convex program- ming.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets SMC: Satisfiability modulo convex program- ming

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.511579Z

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.

source=pdf_text observed=2026-08-06T17:30:48.724914Z digest=sha256:b1fbd087dc60c66e2bb3efd66a5ae14365b49761c711f873cbc73bbbb317b429

Observation 6f0d5464-7933-4b97-8ba4-ecb310d138f7 · outbound

This paper cites Nonlinear regulation: The piecewise linear approach.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Nonlinear regulation: The piecewise linear approach

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.501563Z

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.

source=pdf_text observed=2026-08-06T17:30:48.802510Z digest=sha256:636bd5250f3c34d2e5bfe37a152c64bf42b03f15f0c579b1239cc63805dfc7d0

Observation 1dff30c4-d9b0-4c7f-a97b-5d42eb65f614 · outbound

This paper cites Interconnected automata and linear systems: A theoretical framework in discrete-time.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.491948Z

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.

source=pdf_text observed=2026-08-06T17:30:48.870431Z digest=sha256:cf4f2880913324a8bd01d4f1cc4b2758f7f016c42ae0f7ab811902fcfe194edf

Observation 9c64c71f-1cda-4cd4-a6af-585151ae908f · outbound

This paper cites Combined task and motion planning through an extensible planner- independent interface layer.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.481910Z

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.

source=pdf_text observed=2026-08-06T17:30:48.943104Z digest=sha256:7732d93bd5efba8edc59b20236189bd2a15abac9b00371507097e2788e9cfd20

Observation 06c0ae8a-c1cb-4eb8-8a31-aae7a7c3f156 · outbound

This paper cites $A^*$ for Graphs of Convex Sets.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets $A^*$ for Graphs of Convex Sets

Reference 52

Resolution
unresolved
no resolver link, observed 2026-08-06T17:30:49.027342Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T17:30:49.027342Z digest=sha256:0d975b06be7fcc3eb001a77d5c7c9adf8dc54a636ba15ae94b2c08a74c62ca24

Observation 3107d9d7-c28f-4919-b641-cc1c2265c5a5 · outbound

This paper cites Between MDPs and semi-MDPs: A framework for tem- poral abstraction in reinforcement learning.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.471092Z

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.

source=pdf_text observed=2026-08-06T17:30:49.099851Z digest=sha256:86dd4b14db8c7273fd39ecfedd3c950e82be6332c2fd3aa08790fbc53b356800

Observation 5c616e5d-dc76-4849-8f2c-9e6307dc0321 · outbound

This paper cites LQR-trees: Feedback motion plan- ning on sparse randomized trees.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.461090Z

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.

source=pdf_text observed=2026-08-06T17:30:49.171932Z digest=sha256:ef3d30126344af923b17b75ffd595b532dc5004f2b6ed63676a547b13baac1fc

Observation a6cc794c-36c6-4e73-a4d0-ac108ccc8c16 · outbound

This paper cites Logic-geometric programming: An optimization-based approach to combined task and mo- tion planning.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.451040Z

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.

source=pdf_text observed=2026-08-06T17:30:49.246297Z digest=sha256:18a79ceadb7fe91c33c584111aab660ff567af94e0d2fd7bf35b7066ea8c969e

Observation d3b33eb0-08bf-466a-9399-408fac7933fa · outbound

This paper cites Time-optimal path tracking for robots: A convex optimization approach.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.441511Z

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.

source=pdf_text observed=2026-08-06T17:30:49.312234Z digest=sha256:4ed71008a771470f2e366a556e6655fa21ed1c89a902c8e6224998d3be75f051

Observation fc73d427-d685-4291-a642-8e02252f405c · outbound

This paper cites Using graphs of convex sets to guide nonconvex trajectory optimiza- tion.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.431413Z

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.

source=pdf_text observed=2026-08-06T17:30:49.406220Z digest=sha256:285192002a36a3bdb821b7e95b95f83ba2c4e3bb202425724be95d620d022d7d

Observation 04e59d58-88b7-4c13-9544-9538e613b8e0 · outbound

This paper cites Zero- moment point—thirty five years of its life.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Zero- moment point—thirty five years of its life

Reference 58

Resolution
unresolved
no resolver link, observed 2026-08-06T17:30:49.484984Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T17:30:49.484984Z digest=sha256:010e45bbfd56c2ac2534ad5c166015e22a945c2c266d693c2b4bc5a23e834f2f

Observation b9b2a770-8f26-4cae-9cc0-f03a2f1d1937 · outbound

This paper cites Kinody- namic RRT*: Asymptotically optimal motion planning for robots with linear dynamics.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.289998Z

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.

source=pdf_text observed=2026-08-06T17:30:49.562761Z digest=sha256:7ba6db834927a16bc07d4b783f6c245c44d4c15d5ac597c59f2547183f14678d

Observation efae06d5-74b4-4b6e-83ac-07f3f86938ab · outbound

This paper cites Approximating robot configura- tion spaces with few convex sets using clique covers of visibility graphs.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:51.127198Z

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.

source=pdf_text observed=2026-08-06T17:30:49.606146Z digest=sha256:4cd462099032e29dd0b80012b06f1fc3d5ddb75255c9cfed9e53085335949ff8

Observation bcb972c7-cf6e-4870-9ce3-4bed143cba18 · outbound

This paper cites Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space.

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

Resolution
unresolved
no resolver link, observed 2026-08-06T17:30:49.674096Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T17:30:49.674096Z digest=sha256:61f88fdf5bb44b72316f3d4c76e0a63648714a7af16aa34c046fd06cd9235fd6

Observation 5725ae6d-a4d3-49b3-9032-84949f73addb · outbound

This paper cites R3T: Rapidly-exploring random reachable set tree for optimal kinodynamic planning of nonlinear hybrid systems.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:50.891814Z

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.

source=pdf_text observed=2026-08-06T17:30:49.844432Z digest=sha256:ef48b5e2b0db54523370545244f83dceaf40c3f53c027b8dc6eaa4278fbc7c9d

Observation 182abb6a-2f61-4317-89d7-94a7b81a536e · outbound

This paper cites Optimization-based collision avoidance.

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets Optimization-based collision avoidance

Reference 63

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:30:50.685956Z

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.

source=pdf_text observed=2026-08-06T17:30:49.990716Z digest=sha256:64909088ec4de905b4b3b037ea2c7ba970b4fde2787f60127aceb93e629648ff

Pith citing papers

Observation 4677e346-0f88-46a7-90cf-adbf8196c61d · inbound

Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets cites this paper.

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

Resolution
verified exact
arxiv_id, observed 2026-07-02T11:56:54.806404Z

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.

source=arxiv_source observed=2026-07-02T11:55:26.547792Z digest=sha256:481f35c01ce64ada90d8c3a66304336552fde2b68da14444bdaf369e4911c134