Comments, docstrings, help strings, printed labels and READMEs now say INIT, the repair of Eq. (5) and gradient
projection instead of algorithm numbers, so the text does not depend on the paper's numbering. The root README
keeps one line with the paper's numbers (and the cone projection, Algorithm 4).
No code, identifier, option or result key changed. The one stored string that changed is the "algorithm" field
that globmp.synthetic.run writes for new runs; the reference files are unchanged.
Algorithm 2 as written in the paper: step 1/beta and the repair of Eq. (5)
- globmp/repair.py (new): the repair of Algorithm 2 (Algorithm 1 in the paper), Eq. (5). After a cost step Y, the
next curve is the point nearest to Y of the set where every block, linearized at the current feasible curve, is
nonnegative on its whole interval. The solve keeps a list of contacts (block, instant): find the instants at
which a linearized block is negative, add them, fit nonnegative weights of all listed contacts jointly, repeat
until none is negative. Problem.repair(Y, z, tv); Problem.repair_tol.
- globmp/gpa.py: Problem.solve repairs with it (Problem.alg2_repair = 'eq5', the default). 'restore' keeps the
restoration of restore.py as the repair; the scaling study and Maze2D set it, because their results were
obtained with it, and the 'sampled' and 'orthant' modes always use it. The restoration still makes an
infeasible seed feasible.
- Section 4.1 (globmp/synthetic/run.py): one configuration, Algorithm 2 with step 1/beta and this repair from
INIT's curve; …
INIT in one run (Algorithm 3 as printed): best-first over the pairs with an exact piece test and a stop at the first obstacle-free completion that passes; no budget, no known feasible curve; gridstart.start uses it; the layered form is kept as init
INIT as in Algorithm 3: candidates and an optional budget U, returns the cheapest feasible candidate or none; gridstart.start: two runs of INIT, the start is the returned grid point or z0
INIT takes a feasible curve z0: its cost is the budget and it is returned when no candidate is cheaper (Algorithm 3); gridstart: the start in two runs (joint positions with zero velocity, GlobMP, INIT on the grid with z0), stage start and reference
- globmp/init.py: INIT (Algorithm 3) as one function, the shortest path over the joints for given
per-joint state sets, with exact piece tests, budget pruning (cost-to-go rule by default, plain
budget rule as an argument) and back-pointers.
- globmp/gridstart: instance.py supplies the grid values per joint, the piece cost and the piece
test (GridStates, grid_start); plain_grid.py holds the plain grid; init.py removed. reference/
reproduces (same z_h and test counts in 36 of 36 cases).
- globmp/synthetic: joints.py supplies the per-pair states (positions on a grid, zero derivatives),
piece cost, piece test and route label; init.py removed. Same class and joints as before on all
80 instances; INIT takes 0.5 to 1.3 s per instance (median per robot count).
- The name INIT is used everywhere; the ranking file is N*_i*_init.json.
- gridstart run.py --first-order calls the current Algorithm 2 again.
gridstart exact repair: a solver answer is used only if it is reported solved, or passes the block test and does not raise the cost; descent returns the cheapest feasible iterate; reference rerun (same counts, gaps below 1e-9)
globmp/gridstart reorganized: init.py holds INIT (Algorithm 3) and the plain grid only, instance.py the instance and the exact piece test, exact_repair.py the repair step and GlobMP with it; READMEs point to Algorithm 3
Grid start of Theorem 1 by a shortest path over the joints (Algorithm INIT): globmp/gridstart with the instance, INIT, the plain grid, the exact repair step and reference results