Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-16T10:13:23.471172Z
Paper Citation Record · LEDGER
A biconvex method for minimum-time motion planning through sequences of convex sets
As of 20 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 4 inbound Pith citation observations for arXiv:2504.18978.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+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-08-05T02:28:24.338817Z
Reference resolution
49 of 49 outbound references displayed
- verified exact1
- verified fuzzy32
- unresolved16
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
0
arxiv_reference, observed 2026-08-05T02:28:24.338817Z
Outbound references
Observation 60439325-8f10-4659-b5bc-e5bef75fb0bc · outbound
This paper cites Practical methods for optimal control and estimation using nonlinear programming.
A biconvex method for minimum-time motion planning through sequences of convex sets Practical methods for optimal control and estimation using nonlinear programming
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.289191Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e1188561-c238-4afd-a720-1bd1209b53bd · outbound
This paper cites Massively parallelizing the RRT and the RRT*.
A biconvex method for minimum-time motion planning through sequences of convex sets Massively parallelizing the RRT and the RRT*
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:24.296926Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 443eb905-2f9b-4546-9b1d-6d927d27cd66 · outbound
This paper cites Convex opti- mization.
A biconvex method for minimum-time motion planning through sequences of convex sets Convex opti- mization
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:24.285474Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation d7803458-43c0-47ff-b336-9ff916e1812c · outbound
This paper cites Online gener- ation of collision-free trajectories for quadrotor flight in unknown cluttered environments.
A biconvex method for minimum-time motion planning through sequences of convex sets Online gener- ation of collision-free trajectories for quadrotor flight in unknown cluttered environments
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:24.273914Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 571e42bc-c691-4e9b-8e51-5de68492a552 · outbound
This paper cites GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets.
A biconvex method for minimum-time motion planning through sequences of convex sets GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.305694Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 882b43af-11c5-49f7-b1d1-b1aa9e31bdd5 · outbound
This paper cites Certified polyhedral de- compositions of collision-free configuration space.
A biconvex method for minimum-time motion planning through sequences of convex sets Certified polyhedral de- compositions of collision-free configuration space
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:24.262278Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 318a747c-a43e-4514-b33b-f7b0e4a07b7f · outbound
This paper cites Computing large con- vex regions of obstacle-free space through semidefinite programming.
A biconvex method for minimum-time motion planning through sequences of convex sets Computing large con- vex regions of obstacle-free space through semidefinite programming
Reference 7
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.314078Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c406c401-1754-497b-93d3-80fddec9971b · outbound
This paper cites Efficient mixed-integer planning for UA Vs in cluttered environments.
A biconvex method for minimum-time motion planning through sequences of convex sets Efficient mixed-integer planning for UA Vs in cluttered environments
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:24.237952Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 2f27150b-d4ea-4a36-a748-2e99917b6790 · outbound
This paper cites A general system for heuristic minimization of convex functions over non-convex sets.
A biconvex method for minimum-time motion planning through sequences of convex sets A general system for heuristic minimization of convex functions over non-convex sets
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:24.199629Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 8e4ec8b1-a1ee-41fe-89d0-27a772ecf360 · outbound
This paper cites Algorithms for polynomials in Bernstein form.
A biconvex method for minimum-time motion planning through sequences of convex sets Algorithms for polynomials in Bernstein form
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:24.064196Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation a5763696-ef71-41fa-be8e-36b6916730ef · outbound
This paper cites SNOPT: An SQP algorithm for large-scale constrained optimization.
A biconvex method for minimum-time motion planning through sequences of convex sets SNOPT: An SQP algorithm for large-scale constrained optimization
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.920061Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 54b0b2a6-6ad3-4123-a724-0db18b4040c2 · outbound
This paper cites Clarabel: An interior-point solver for conic programs with quadratic objectives.
A biconvex method for minimum-time motion planning through sequences of convex sets Clarabel: An interior-point solver for conic programs with quadratic objectives
Reference 12
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.334399Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6d8298ca-416d-4a21-add2-d0e60699be7e · outbound
This paper cites ALTRO: A fast solver for constrained trajectory optimization.
A biconvex method for minimum-time motion planning through sequences of convex sets ALTRO: A fast solver for constrained trajectory optimization
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.908548Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation c7071547-1855-424c-89b2-5d8cfc8bc062 · outbound
This paper cites Gomp: Grasp- optimized motion planning for bin picking.
A biconvex method for minimum-time motion planning through sequences of convex sets Gomp: Grasp- optimized motion planning for bin picking
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.897022Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation bfd4ec42-830e-4ff8-976d-41a40952934f · outbound
This paper cites STOMP: Stochastic trajectory optimization for motion planning.
A biconvex method for minimum-time motion planning through sequences of convex sets STOMP: Stochastic trajectory optimization for motion planning
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.886601Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 2df9d2e6-8527-4d06-bc9e-547dbed44e0d · outbound
This paper cites Optimal kino- dynamic motion planning using incremental sampling- based methods.
A biconvex method for minimum-time motion planning through sequences of convex sets Optimal kino- dynamic motion planning using incremental sampling- based methods
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.874870Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation da394aa4-8a5a-46b2-b431-ab5deb8c7021 · outbound
This paper cites Sampling-based al- gorithms for optimal motion planning.
A biconvex method for minimum-time motion planning through sequences of convex sets Sampling-based al- gorithms for optimal motion planning
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.863845Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation f9a56e22-5471-4760-b0ca-ca1f406f63ab · outbound
This paper cites Probabilistic roadmaps for path planning in high-dimensional configuration spaces.
A biconvex method for minimum-time motion planning through sequences of convex sets Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.852281Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 40549601-b409-4d03-b1b2-94875d84938b · outbound
This paper cites Rapidly-exploring random trees: A new tool for path planning.
A biconvex method for minimum-time motion planning through sequences of convex sets Rapidly-exploring random trees: A new tool for path planning
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.840401Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation bc8c9cc0-ff99-4cea-a266-c4ec922c5911 · outbound
This paper cites Randomized kinodynamic planning.
A biconvex method for minimum-time motion planning through sequences of convex sets Randomized kinodynamic planning
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.829318Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation c7807a39-b3b0-436f-9997-897e90e1d8e1 · outbound
This paper cites Time-optimal control of a multidimensional in- tegrator chain with applications.
A biconvex method for minimum-time motion planning through sequences of convex sets Time-optimal control of a multidimensional in- tegrator chain with applications
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.817642Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 26121716-a5fe-455e-85cb-797b006f5419 · outbound
This paper cites Asymptotically optimal sampling-based kinodynamic planning.
A biconvex method for minimum-time motion planning through sequences of convex sets Asymptotically optimal sampling-based kinodynamic planning
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.806813Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 0511ad8c-e182-43ec-a585-b467efca34e4 · outbound
This paper cites Minimum-time speed optimisation over a fixed path.
A biconvex method for minimum-time motion planning through sequences of convex sets Minimum-time speed optimisation over a fixed path
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.795230Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 653fcdfb-960b-4e7f-9367-31bd473eafce · outbound
This paper cites Planning dynamically feasible trajectories for quadrotors using safe flight corridors in 3-D complex environments.
A biconvex method for minimum-time motion planning through sequences of convex sets Planning dynamically feasible trajectories for quadrotors using safe flight corridors in 3-D complex environments
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.783758Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 8caf59a8-3b5b-43c1-85f4-6af7d8bb9316 · outbound
This paper cites Convex optimization for trajectory generation: A tutorial on generating dynamically feasible trajectories reliably and efficiently.
A biconvex method for minimum-time motion planning through sequences of convex sets Convex optimization for trajectory generation: A tutorial on generating dynamically feasible trajectories reliably and efficiently
Reference 25
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.773507Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation bbc274c0-3bfe-46a2-b995-1eba49d1ffb3 · outbound
This paper cites Graphs of Convex Sets with Applications to Optimal Control and Motion Planning.
A biconvex method for minimum-time motion planning through sequences of convex sets Graphs of Convex Sets with Applications to Optimal Control and Motion Planning
Reference 26
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.387627Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4729e5b6-9f89-4ece-b61f-174435ddcbe5 · outbound
This paper cites Motion planning around obstacles with convex optimization.
A biconvex method for minimum-time motion planning through sequences of convex sets Motion planning around obstacles with convex optimization
Reference 27
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.391278Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation aba7e870-8688-4c41-ba2e-57823cc12785 · outbound
This paper cites Fast path planning through large collections of safe boxes.
A biconvex method for minimum-time motion planning through sequences of convex sets Fast path planning through large collections of safe boxes
Reference 28
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.749671Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 7b9cc1a5-3397-46cb-9151-7651f18e4aea · outbound
This paper cites Shortest paths in graphs of convex sets.
A biconvex method for minimum-time motion planning through sequences of convex sets Shortest paths in graphs of convex sets
Reference 29
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.398967Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ad4a6aa6-91bf-48e7-b907-a23380cb1f27 · outbound
This paper cites Multi-Query Shortest-Path Problem in Graphs of Convex Sets.
A biconvex method for minimum-time motion planning through sequences of convex sets Multi-Query Shortest-Path Problem in Graphs of Convex Sets
Reference 30
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.402434Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b1c4b207-2262-45cf-bba1-f75f2915fb6d · outbound
This paper cites GPU-based parallel colli- sion detection for fast motion planning.
A biconvex method for minimum-time motion planning through sequences of convex sets GPU-based parallel colli- sion detection for fast motion planning
Reference 31
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.730062Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 1e51835b-c7df-4224-a004-c930cfce1512 · outbound
This paper cites Semidefinite programming relaxations for semialgebraic problems.
A biconvex method for minimum-time motion planning through sequences of convex sets Semidefinite programming relaxations for semialgebraic problems
Reference 32
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.410346Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 02a0e0e5-19b4-4301-8aa5-7037d62907c7 · outbound
This paper cites Motion planning with sequential convex optimization and convex colli- sion checking.
A biconvex method for minimum-time motion planning through sequences of convex sets Motion planning with sequential convex optimization and convex colli- sion checking
Reference 33
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.413980Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a4a15e77-f7fe-4b33-bb9b-97d9b63a9fb2 · outbound
This paper cites Disciplined multi-convex programming.
A biconvex method for minimum-time motion planning through sequences of convex sets Disciplined multi-convex programming
Reference 34
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.703450Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation b25c6a03-0df2-4674-bdfa-85d66de34ad9 · outbound
This paper cites Curobo: Parallelized collision-free robot motion generation.
A biconvex method for minimum-time motion planning through sequences of convex sets Curobo: Parallelized collision-free robot motion generation
Reference 35
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.691839Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 7ae4c39c-f48c-496f-ae81-6a3c209c11f7 · outbound
This paper cites Drake: Model-based design and verification for robotics, 2019.
A biconvex method for minimum-time motion planning through sequences of convex sets Drake: Model-based design and verification for robotics, 2019
Reference 36
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.680188Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 9a90f3b3-792d-472b-b31f-0d13f1af4761 · outbound
This paper cites LQR-trees: Feedback motion planning via sums-of-squares verification.
A biconvex method for minimum-time motion planning through sequences of convex sets LQR-trees: Feedback motion planning via sums-of-squares verification
Reference 37
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.669609Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 7024b4d5-fc2d-4102-a125-fe89e27c61e5 · outbound
This paper cites Motions in microseconds via vectorized sampling-based planning.
A biconvex method for minimum-time motion planning through sequences of convex sets Motions in microseconds via vectorized sampling-based planning
Reference 38
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.659209Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation a0fd8fd4-d599-4645-a1e0-8ad525271607 · outbound
This paper cites Newton methods for k-order Markov Constrained Motion Problems.
A biconvex method for minimum-time motion planning through sequences of convex sets Newton methods for k-order Markov Constrained Motion Problems
Reference 39
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.435005Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b4096b91-1a3d-45f1-bf80-cd6415e2be09 · outbound
This paper cites Time-optimal path tracking for robots: A convex optimization approach.
A biconvex method for minimum-time motion planning through sequences of convex sets Time-optimal path tracking for robots: A convex optimization approach
Reference 40
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.438581Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f114c9fc-4caf-4f73-a609-9ddbe17a77a9 · outbound
This paper cites On the imple- mentation of an interior-point filter line-search algorithm for large-scale nonlinear programming.
A biconvex method for minimum-time motion planning through sequences of convex sets On the imple- mentation of an interior-point filter line-search algorithm for large-scale nonlinear programming
Reference 41
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.641399Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation b820f76d-99c6-48df-ac0a-766c6c3d4be2 · outbound
This paper cites Fast Iterative Region Inflation for Computing Large 2-D/3-D Convex Regions of Obstacle-Free Space.
A biconvex method for minimum-time motion planning through sequences of convex sets Fast Iterative Region Inflation for Computing Large 2-D/3-D Convex Regions of Obstacle-Free Space
Reference 42
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.445387Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation af15c0c9-c433-40ed-a9fb-d395ccdf1d8b · outbound
This paper cites Fast model predictive control using online optimization.
A biconvex method for minimum-time motion planning through sequences of convex sets Fast model predictive control using online optimization
Reference 43
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.627931Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation ed98c6d5-347a-4be6-b3e2-53cb86aa935e · outbound
This paper cites Approximating robot configu- ration spaces with few convex sets using clique covers of visibility graphs.
A biconvex method for minimum-time motion planning through sequences of convex sets Approximating robot configu- ration spaces with few convex sets using clique covers of visibility graphs
Reference 44
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.615712Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation edb959fc-a373-418a-b7cd-b216672c5376 · outbound
This paper cites Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space.
A biconvex method for minimum-time motion planning through sequences of convex sets Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space
Reference 45
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.456401Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ba18b83e-ee19-414a-a14f-292b950fe33c · outbound
This paper cites Superfast Configuration-Space Convex Set Computation on GPUs for Online Motion Planning.
A biconvex method for minimum-time motion planning through sequences of convex sets Superfast Configuration-Space Convex Set Computation on GPUs for Online Motion Planning
Reference 46
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.460132Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation dc08076b-b026-43ad-9d2a-039ec1495baf · outbound
This paper cites Towards Optimizing a Convex Cover of Collision-Free Space for Trajectory Generation.
A biconvex method for minimum-time motion planning through sequences of convex sets Towards Optimizing a Convex Cover of Collision-Free Space for Trajectory Generation
Reference 47
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.463926Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 98b5ab9b-3d20-40f4-b02c-af5e4827168f · outbound
This paper cites A New Semidefinite Relaxation for Linear and Piecewise-Affine Optimal Control with Time Scaling.
A biconvex method for minimum-time motion planning through sequences of convex sets A New Semidefinite Relaxation for Linear and Piecewise-Affine Optimal Control with Time Scaling
Reference 48
- Resolution
- verified exact
- local_arxiv, observed 2026-08-16T10:13:23.510975Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 116a69c1-f251-46f8-b6e3-310cb792d28e · outbound
This paper cites tangent” and “projection.
A biconvex method for minimum-time motion planning through sequences of convex sets tangent” and “projection
Reference 49
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T10:13:23.604352Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Pith citing papers
Observation b25d1124-536b-4c6f-8896-58864946b778 · inbound
Learning Material-Aware Hamiltonian Risk Fields for Safe Navigation cites this paper.
Learning Material-Aware Hamiltonian Risk Fields for Safe Navigation A biconvex method for minimum-time motion planning through sequences of convex sets
Reference 30
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T04:50:54.635875Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 6506692f-1b79-404c-8547-5af29e92e88b · inbound
Learning Material-Aware Hamiltonian Risk Fields for Safe Navigation cites this paper.
Learning Material-Aware Hamiltonian Risk Fields for Safe Navigation A biconvex method for minimum-time motion planning through sequences of convex sets
Reference 153
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T01:05:50.139808Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation c713eda7-f4e2-4054-bab0-e2daf75f93cd · inbound
Scaling Self-Evolving Agents via Parametric Memory cites this paper.
Scaling Self-Evolving Agents via Parametric Memory A biconvex method for minimum-time motion planning through sequences of convex sets
Reference 10
- Resolution
- metadata mismatch
- arxiv_id, observed 2026-07-02T07:46:45.846227Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 73d5a980-2cff-4d1d-920b-afcb73548bd8 · 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 A biconvex method for minimum-time motion planning through sequences of convex sets
Reference 76
- Resolution
- verified exact
- arxiv_id, observed 2026-07-02T11:56:54.809954Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.