Pith. sign in

Paper Citation Record · LEDGER

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

As of 18 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 2 inbound Pith citation observations 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 65 of 65 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T15:10:14.602785Z

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:45.186531Z digest=sha256:00ac45217569a3c5aaf43c94b3bbe4513bb6418468031133a754f202347615ff

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:45.358257Z digest=sha256:813069a655aa966cd5ef8bd1b7f002937f3ab008deb2cff1e92f570cfff128d4

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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:2fec8357f824f004b1cff881a58ce4b0b2e71ad735396c3a49b369b929fdb0bd

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:45.965413Z digest=sha256:30366a020f922341e21ca9736926608d9a4ce4714630667d6792e60b1d8e6495

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:46.011715Z digest=sha256:32e8c430eba78fcf8e435c3a169293b12854aa092a584a51438ece7db853e788

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:46.095945Z digest=sha256:9f0286b332f98eeb07e080acd0d9621005814f27304c132bc794b18b256f50d8

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:46.237689Z digest=sha256:3e24a4fc9f0ac4621bcef76717b4b33978af71c9400ef4b814dd29bb337bb5e7

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:46.604940Z digest=sha256:0d3c1ebb5f4c7d09f04008563d3e2e85fca70365a0a58647f28edb20ebe666eb

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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:6410b09e89b080bb14dc2cbafe3c51810b9298d9677d798768ecc5c200c28dd9

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:47.004867Z digest=sha256:33e45cf35b2fc84f993459fb4761c7393e14dfa0de332794c7dfb6cb88ada4f2

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:47.104237Z digest=sha256:1c1fbaa4479796896041f70bc97cd82855efafb777c9bf85ff86d2cb4ba13466

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:47.355703Z digest=sha256:83386b83b6ca35e7d2729114b9bb93045cee3cc1f59ec57586c7a947b8c242dc

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:47.491813Z digest=sha256:94ee4f15697618e57340e5b926dd67f406e83c940b980811e4c26bea2f2c3c03

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:47.707370Z digest=sha256:91b9588a90c856182f82a64ef9786b23794f467db27758a947bb6e8f5618dc64

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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:5193e87e65c659307213d364495158d4383d9a38c8053e6d1ec895b772054e4a

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:986061368b67c524c33735833d752ef00a5cb7b4ed2227113dd66916f89ba6f3

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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:faf3fd9479b82a60517a386a5a330bd7b4f6d893c65d784f136b9e43061827bb

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:48.643319Z digest=sha256:59d4c356bfdde72565b83b884fb57da0082f1693a787b56e64c3ed9e50b8a4c8

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:48.802510Z digest=sha256:13071980753fc096edf587fd3766843db2d76a63a7d39a5a9c2ec32e80fd876c

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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:057f87ff3ff2e1a55b62e00dc7fe62c54463a413e9ea2395aa819723f87734c1

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:49.099851Z digest=sha256:5cca41edb49832165e01e3d02ecaba165b3c2276b1c63041d728d355d3734cef

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:49.246297Z digest=sha256:7c7f4fb4d5865cfc538e2eafeb052abb6343861ca5d4c1bd4c82f663ffb9db6f

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:49.312234Z digest=sha256:5e993ec1a4eb51a263128927021947842c7fa2dcac6d7f0543cc411700bec6c1

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:49.406220Z digest=sha256:99d2718ae3035ca00d5686cf696c59ed779c017234ee43dd67ce58e85b0e9cd5

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:a3f83046e2c3273da04e53b172fa4d31e04e8bc956be0f3512c54ac6f1dc2c55

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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:abb34baacfd98b0f17a4f74a47a8d64d87f9249754c8277ec8fcf6fe640459f0

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T17:30:49.990716Z digest=sha256:50f62fd8ce85c5c32b783983d3ac210408845536054f0e17db66984579c51bc9

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-18T06:34:40.430872+00:00.

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

Observation 96d0a455-3288-42f4-a3f7-38748f726cb4 · inbound

Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles cites this paper.

Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-15T15:10:14.602785Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T15:10:14.602785Z digest=sha256:3a9bca287e4f8a98781edd17e1ee3d4471b7084d6c9e9450c11f720df5dce16c