An iterative inner-outer polyhedral approximation algorithm solves the ray-intersection formulation of growth distance for convex sets with representable support functions and delivers state-of-the-art speed with primal-dual feasibility and monotone convergence.
Motion planning with sequential convex optimization and convex collision checking
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A literature review of intelligent automation approaches using robotics, AI, and control for disassembly, inspection, sorting, and reprocessing of end-of-life electronics.
citing papers explorer
-
A Ray Intersection Algorithm for Fast Growth Distance Computation Between Convex Sets
An iterative inner-outer polyhedral approximation algorithm solves the ray-intersection formulation of growth distance for convex sets with representable support functions and delivers state-of-the-art speed with primal-dual feasibility and monotone convergence.
-
Redefining End-of-Life: Intelligent Automation for Electronics Remanufacturing Systems
A literature review of intelligent automation approaches using robotics, AI, and control for disassembly, inspection, sorting, and reprocessing of end-of-life electronics.