Pith.

Computational Engineering, Finance, and Science · arXiv:2611.16357 v1 · submitted 12 Nov 2026 · 76 references

Optimal Seat Movement Strategies Among Modular Bus Units

Shiyue Wang, Yuhao Liu, Zhibin Chen, Mingyang Pei, Changhong Lu

The paper says

“Movable seats enable passengers to transfer between coupled modular bus units while remaining seated, but require physical reconfiguration that existing modular transit models largely abstract away.”

more of the abstract

We model seat reconfiguration as a colored generalized sliding-tile puzzle on the physical track graph, capturing simultaneous movements, seat indistinguishability within destination groups, and vertex, edge, and corner-following conflicts. A lexicographic objective minimizes makespan first and then the sum of costs (SoC), which penalizes movements and waiting at non-target positions. We develop an exact time-expanded mixed-integer linear programming formulation and a Boundary-Sequence Dynamic Programming (BSDP) algorithm. BSDP decomposes the problem at single-edge module interfaces and coordinates local schedules through compressed boundary-crossing sequences, provably preserving feasibility and optimal costs. On two- and three-module benchmarks, BSDP achieves mean per-instance speedups of 3.24x and 6.30x over Gurobi, respectively. In fixed-horizon tests with four to seven modules, both methods start from identical greedy schedules and receive a 300 s budget. BSDP obtains lower final SoC than Gurobi on 197 of 200 instances and ties on three, reducing mean final SoC by 17.93%-69.07% across the four size classes. Geometry sensitivity and ablation studies further clarify the contribution of boundary compression to computational performance. The framework links seat reconfiguration to the timing and operational cost of modular bus decoupling.

from the abstract

Pith says

Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

Holds up, with conditions. A technically solid, niche contribution that formulates and optimally solves a previously unoptimized subproblem in modular transit. The BSDP algorithm is a genuine advance for this specific problem, but the impact is bounded by the narrow scope and the lack of open code/data. This line is wrong

5 major objections · 10 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 76 references say.

The paper says, at §6.5, Eq. (66) and surrounding text

The review did not quote this passage.

Pith says: Objection 1 of 5 · major

The exactness proof of BSDP (Theorem 2) relies on the claim that the compressed boundary representation (DFA + weighted-DAG merging) preserves feasibility and optimal cost. The DFA pruning condition (66) is a necessary condition for cut balance, but the paper does not prove that it is sufficient for local physical realizability inside a module.

more of objection 1

The weighted-DAG merging (80) merges nodes with identical continuation cost functions over all remaining suffixes. However, the continuation cost function is defined only over suffixes that survive the DFA pruning. Two nodes that have identical continuation costs over this subset might have different continuation costs over a suffix that was pruned by the DFA but would be feasible in the full boundary language. If such a suffix is actually realizable by the module (i.e., there exists a local schedule consistent with that suffix), then the merged representation could incorrectly discard it, potentially losing the optimal schedule. The paper does not prove that the DFA pruning condition is sufficient for local realizability, nor that the weighted-DAG merging is exact given the pruned suffix set. This gap threatens the exactness proof for the compressed representation, and consequently the optimality guarantee of BSDP. The authors should either provide a proof that the pruning condition is sufficient for local realizability (or that any suffix satisfying the necessary condition can be extended to a full feasible schedule), or clarify that the compression is exact only under an additional assumption that is satisfied by the problem structure. Without this, the claim of exactness for BSDP is not fully justified.

The paper says, at §6.5, Eq. (80) and surrounding text

The review did not quote this passage.

Pith says: Objection 2 of 5 · major

The weighted-DAG merging criterion (80) merges nodes with identical continuation cost functions over all remaining suffixes. However, the continuation cost function is defined only over suffixes that survive the DFA pruning. Two nodes that have identical continuation costs over this subset might have different continuation costs over a suffix that was pruned by the DFA but would be feasible in the full boundary language.

more of objection 2

If such a suffix is actually realizable by the module (i.e., there exists a local schedule consistent with that suffix), then the merged representation could incorrectly discard it, potentially losing the optimal schedule. The paper does not prove that the DFA pruning condition is sufficient for local realizability, nor that the weighted-DAG merging is exact given the pruned suffix set. This gap threatens the exactness proof for the compressed representation, and consequently the optimality guarantee of BSDP.

The paper says, at §7.2, Table 3 and Figure 9

The review did not quote this passage.

Pith says: Objection 3 of 5 · major

The runtime comparison for 3-module instances shows that Gurobi times out on 6% of instances (3 out of 50). The mean runtime for Gurobi is reported as 300.503s, which includes the 1800s timeout runs. This inflates the mean and the speedup calculation.

more of objection 3

The authors should report the mean runtime excluding timeouts, or use a different aggregation (e.g., median) to give a fairer comparison. The speedup of 6.30x is based on the inflated mean; the actual speedup on instances solved by both methods may be lower. The authors should clarify this and provide statistics that are robust to timeouts.

The paper says, at §7.3, Table 4

The review did not quote this passage.

A classifier read this sentence of the paper as acknowledging the concern (probability 0.84):

“These results establish an advantage in fixed-horizon improvement, rather than a claim that the larger instances have been solved to lexicographic optimality.”

Pith says: Objection 4 of 5 · major

The fixed-horizon experiments for 4-7 modules use a 300s time limit and start from identical greedy schedules. The claim that BSDP 'obtains lower final SoC than Gurobi on 197 of 200 instances' is clear. However, the comparison is not a direct test of the lexicographic optimization (makespan + SoC) because the horizon is fixed and not necessarily optimal.

more of objection 4

The paper acknowledges this (line [b669]), but the title and abstract emphasize 'optimal seat movement strategies', which could be misinterpreted. The authors should be more explicit in the abstract and introduction that the larger-scale results are for fixed-horizon improvement, not full lexicographic optimality. The current phrasing 'BSDP obtains lower final SoC than Gurobi' is accurate but could be misleading without the context that the makespan is fixed and not necessarily optimal.

The paper says, at §7.4, Figure 11 and Table 5

The review did not quote this passage.

Pith says: Objection 5 of 5 · major

The sensitivity analysis for module width m is informative, but the number of instances per setting is only 50, and the comparison is only for 2-3 modules. The authors should discuss whether the trends observed (e.g., larger speedup for narrower modules) are statistically significant. Additionally, the m=4 case for 2 modules shows a modest speedup of 1.52x, which is much smaller than the m=3 case. The authors should provide some intuition for why the advantage diminishes for wider modules.

10 minor objections

The paper says, at §1, paragraph 2

Pith says: minor objection 1 of 10

The sentence 'This paper therefore introduces and solves the optimal MB seat movement problem among coupled modular bus units.' appears twice (once at the end of paragraph 2 and once at the beginning of paragraph 3). Please remove the duplicate.

The paper says, at §4.2, Definition 1

Pith says: minor objection 2 of 10

The state matrix definition uses notation X[v] for vertex v, but later the matrix is indexed as X[r,j]. This is consistent, but it would be helpful to explicitly state that v = (r,j) to avoid confusion.

show 8 more

The paper says, at §5, Eq. (27)-(33)

Pith says: minor objection 3 of 10

The MILP formulation includes constraints (30) and (31) for flow conservation. It might be helpful to note that these constraints implicitly enforce that each seat selects exactly one action per time step, which is already stated in the text.

The paper says, at §6.2, Eq. (47)

Pith says: minor objection 4 of 10

The definition of d_i^c uses the prefix set P_i. It might be clearer to explicitly state that d_i^c is the net number of color-c seats that must cross boundary i from left to right.

The paper says, at §6.5, Eq. (66)

Pith says: minor objection 5 of 10

The pruning condition uses the L1 norm of the difference between required and current net transfer. The authors should note that this condition is necessary but not sufficient for local realizability, which is acknowledged in the text but could be emphasized more.

The paper says, at §7.1, Eq. (93)-(94)

Pith says: minor objection 6 of 10

The data generation procedure uses a target-aware color assignment to minimize the sum of assignment distances. This is a reasonable heuristic, but it may introduce a bias towards easier instances. The authors should discuss whether this affects the generality of the results.

The paper says, at §7.2, Table 3

Pith says: minor objection 7 of 10

The table reports 'CV' (coefficient of variation) for runtime. It would be helpful to define CV in the caption or text.

The paper says, at §7.3, Figure 10

Pith says: minor objection 8 of 10

The convergence plots for three selected instances are informative, but the selection criteria are not stated. The authors should explain why these particular instances were chosen (e.g., representative, best, worst case).

The paper says, at §8, paragraph 3

Pith says: minor objection 9 of 10

The sentence 'The additional experiments clarify the sources and scope of these gains.' could be more specific about which experiments (ablation, sensitivity) are being referred to.

The paper says, at Appendix A

Pith says: minor objection 10 of 10

The detailed results tables are extensive and useful. However, the 95% confidence intervals for runtime are reported in brackets. It would be helpful to note that these are computed over 10 repeated runs.

What would settle it

Construct a small counterexample (e.g., N=2, m=2, T=4) where the DFA pruning condition (66) is satisfied for a prefix but no local schedule exists for that prefix in one module. Then check whether the weighted-DAG merging (80) would merge two nodes that have identical continuation costs over the pruned suffix set but different costs over a suffix that is feasible in the full boundary language. If such a case exists, the compressed representation is not exact, contradicting Theorem 2. Alternatively, prove that the DFA pruning condition is sufficient for local realizability for the specific track graph and movement rules, or prove that the weighted-DAG merging is exact despite the pruned suffix set.

from the skeptic's reading

How the review went

4 readings by deepseek-v4-flash · 13 Nov 2026

  1. Reader holds up, with conditions confidence high
  2. Skeptic disagrees 11 s · 42,200 tokens read, 903 written
  3. Editor wrote the verdict above 20 s · 43,106 tokens read, 678 written
  4. Referee major revision: 5 major objections, 10 minor 16 s · 42,621 tokens read, 2,156 written

Not run on this paper: the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The review in brief, machine-written

This paper does something genuinely new: it formulates the optimal seat movement problem for modular buses as a colored generalized sliding-tile puzzle and develops a dedicated dynamic programming algorithm (BSDP) that exploits the chain topology. The problem is real—existing modular transit models abstract away the physical reconfiguration—and the authors are the first to optimize it. The BSDP algorithm is clever: it decomposes the problem at single-edge module interfaces, uses a DFA to prune boundary schedules, and compresses the search space with weighted-DAG merging. The exactness proof for fixed makespan is sound, and the experimental results are credible: on 2-3 module instances BSDP matches Gurobi on optimality while being 3-6x faster; on 4-7 module instances with a 300s budget it consistently finds better feasible schedules than Gurobi starting from the same greedy initial solution. The ablation study convincingly shows that the DFA compression is the main driver of efficiency.

That said, the paper has real limitations. The most important is that the seat-to-module assignment is taken as given—the paper explicitly decouples assignment from movement optimization. In practice these are interdependent, and the paper acknowledges this as future work, but it means the current contribution is to a subproblem whose boundaries are set by an external decision. Second, the larger instances (4-7 modules) are not solved to optimality; the comparison is on improvement from a common greedy start within a fixed time budget. The authors are transparent about this, but it limits the strength of the claims for larger N. Third, no code or data is provided, which is a reproducibility concern for a paper that ships an algorithm. The stress-test note about the DFA pruning condition being necessary but not sufficient for local realizability is a genuine theoretical gap: the paper does not prove that the compressed boundary representation preserves all feasible schedules, only that it preserves feasibility and optimal cost under the pruning rule. The authors assert this in Theorem 2 but the proof relies on the DFA and weighted-DAG merging being exact, and the pruning condition (66) is indeed only necessary. This is a soft spot in the theoretical foundation, though in practice the algorithm works well.

Who is this for? Researchers in modular transit operations and, more broadly, anyone working on multi-agent path finding on chain-like topologies with interchangeable agents. It deserves a serious referee—the work is technically competent and the problem is well-motivated. I would accept a peer review invitation for this paper.

Recommendation: Accept with major revision. The authors should provide code and data, clarify the exactness claim for the compressed representation (address the DFA pruning gap), and discuss the practical implications of the fixed-assignment assumption more thoroughly.

The strongest objection

The central exactness claim (Theorem 2) depends on the claim that the compressed boundary representation preserves feasibility and optimal cost. The DFA in Section 6.5 uses condition (66) to prune prefixes: a prefix with cumulative transfer vector z' is pruned if the remaining steps cannot satisfy the required net transfers. This condition is necessary but not sufficient for local physical realizability inside a module. The weighted-DAG merging (80) then merges nodes with identical continuation cost functions over all remaining suffixes. However, the DFA has already removed some suffixes from consideration (those that would violate the necessary condition). The continuation cost function is therefore defined only over the subset of suffixes that survive the DFA pruning. Two nodes that have identical continuation costs over this subset might have different continuation costs over a suffix that was pruned by the DFA but would be feasible in the full boundary language. If such a suffix is actually realizable by the module (i.e., there exists a local schedule consistent with that suffix), then the merged representation could incorrectly discard it, potentially losing the optimal schedule. The paper does not prove that the DFA pruning condition is sufficient for local realizability, nor that the weighted-DAG merging is exact given the pruned suffix set. This gap threatens the exactness proof for the compressed representation, and consequently the optimality guarantee of BSDP.

The reader's weakest_assumption focuses on the decoupling of seat assignment from movement optimization, which is a limitation acknowledged by the authors and is not a threat to the internal correctness of the algorithm. The more load-bearing concern is about the exactness of the compressed boundary representation used in BSDP. The paper claims that the DFA and weighted-DAG compression preserve feasibility and optimal cost exactly (Theorem 2). However, the DFA pruning condition (66) is a necessary condition for cut balance, not a sufficient condition for local physical realizability. The weighted-DAG merging (80) merges nodes with identical continuation cost functions, but the continuation cost function is defined only over the set of suffixes that survive DFA pruning. If the DFA prunes a suffix that is actually realizable by the module, then two nodes that have identical continuation costs over the pruned set might have different costs over that suffix, and merging them could lose the optimal schedule. The paper does not address this gap. This is a concrete technical concern about the exactness proof, not a limitation acknowledged by the authors. The concrete test would settle whether this gap actually leads to suboptimality in practice. The verdict should remain CONDITIONAL because the authors should address this concern, but the paper's contributions are still valuable even if the compressed representation is not exact (it could still be a heuristic).

The referee's report

The paper addresses a novel and practically motivated problem at the intersection of modular transit operations and multi-agent path finding. The modeling as a CGSP with lexicographic objective is appropriate. The BSDP algorithm is a clever decomposition that exploits the chain topology of coupled modules. The experimental results demonstrate clear computational advantages over a generic MILP solver. The paper is well-structured and provides rigorous definitions and proofs. The work has potential to inform real modular bus operations by providing a method to compute optimal seat reconfiguration schedules.

Pith's reading of the paper (a machine's summary, not the authors')

Modular buses consist of separable units that can couple or decouple. Passengers may need to be in a specific unit before decoupling. This paper considers movable seats that slide on tracks, allowing passengers to remain seated while their seat moves between units. The problem is to find the sequence of seat movements that minimizes the time to reconfigure all seats (makespan) and, among those, minimizes the total cost of movements and waiting. The authors model this as a colored generalized sliding-tile puzzle on the track graph, where seats are tiles, empty aisle positions are escorts, and seat colors indicate destination modules. They develop an exact mixed-integer linear programming (MILP) formulation and a more efficient Boundary-Sequence Dynamic Programming (BSDP) algorithm. BSDP exploits the chain structure of coupled modules: each module interacts with its neighbors only through a single edge. By representing the crossing events at each boundary as a sequence of symbols, the global problem decomposes into independent module subproblems that are coordinated through these boundary sequences. The algorithm uses finite automata to compress the space of possible boundary sequences. Experiments on small instances (2-3 modules) show BSDP is 3-6 times faster than the MILP solver Gurobi. On larger instances (4-7 modules) with a fixed time budget, BSDP finds better solutions (lower cost) than Gurobi on 197 out of 200 instances.

Core claim. The BSDP algorithm computes the lexicographically optimal (makespan then sum-of-costs) seat movement schedule for the modular bus seat reconfiguration problem, and does so exactly for a fixed makespan. On two- and three-module benchmarks, BSDP achieves mean per-instance speedups of 3.24x and 6.30x over Gurobi, respectively. On four- to seven-module instances with a 300-second budget, BSDP obtains lower final SoC than Gurobi on 197 of 200 instances, reducing mean final SoC by 17.93% to 69.07% across the four size classes.

The premise it rests on. The assumption that the seat-to-module assignment is predetermined and provided as input (Section 4.2, sentence [b205]: 'The state-matrix definition assumes that the seat–unit assignment is predetermined and provided as an input to the optimal seat movement problem.'). This decouples the seat movement optimization from the higher-level assignment problem. In practice, the assignment and movement are interdependent, and jointly optimizing them could yield better overall performance. The paper acknowledges this as a limitation for future work.

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

Movable seats enable passengers to transfer between coupled modular bus units while remaining seated, but require physical reconfiguration that existing modular transit models largely abstract away. We model seat reconfiguration as a colored generalized sliding-tile puzzle on the physical track graph, capturing simultaneous movements, seat indistinguishability within destination groups, and vertex, edge, and corner-following conflicts. A lexicographic objective minimizes makespan first and then the sum of costs (SoC), which penalizes movements and waiting at non-target positions. We develop an exact time-expanded mixed-integer linear programming formulation and a Boundary-Sequence Dynamic Programming (BSDP) algorithm. BSDP decomposes the problem at single-edge module interfaces and coordinates local schedules through compressed boundary-crossing sequences, provably preserving feasibility and optimal costs. On two- and three-module benchmarks, BSDP achieves mean per-instance speedups of 3.24x and 6.30x over Gurobi, respectively. In fixed-horizon tests with four to seven modules, both methods start from identical greedy schedules and receive a 300 s budget. BSDP obtains lower final SoC than Gurobi on 197 of 200 instances and ties on three, reducing mean final SoC by 17.93%-69.07% across the four size classes. Geometry sensitivity and ablation studies further clarify the contribution of boundary compression to computational performance. The framework links seat reconfiguration to the timing and operational cost of modular bus decoupling.

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-11-13

The authors' main claim, as the classifier picked it out 0.92

“BSDP obtains lower final SoC than Gurobi on 197 of 200 instances and ties on three, reducing mean final SoC by 17.93%-69.07% across the four size classes.”

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.09 · states limitation 0.31 · human participants 0.03 · controlled comparison 0.82 · randomized assignment 0.02 · states quantitative result 0.99 · compares with prior results 0.96 · mentions code or data availability 0.03

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
Movable seats enable passengers to transfer between coupled modular bus units while remaining seated, but require physical reconfiguration that existing modular transit models largely abstract away. background 0.64 0.07 0.04 asserted 1.00
We model seat reconfiguration as a colored generalized sliding-tile puzzle on the physical track graph, capturing simultaneous movements, seat indistinguishability within destination groups, and vertex, edge, and corner-following conflicts. method 0.92 0.92 0.05 asserted 1.00
A lexicographic objective minimizes makespan first and then the sum of costs (SoC), which penalizes movements and waiting at non-target positions. method 0.96 0.82 0.06 asserted 0.99
We develop an exact time-expanded mixed-integer linear programming formulation and a Boundary-Sequence Dynamic Programming (BSDP) algorithm. method 0.85 0.96 0.05 asserted 1.00
BSDP decomposes the problem at single-edge module interfaces and coordinates local schedules through compressed boundary-crossing sequences, provably preserving feasibility and optimal costs. method 0.94 0.94 0.20 asserted 1.00
On two- and three-module benchmarks, BSDP achieves mean per-instance speedups of 3.24x and 6.30x over Gurobi, respectively. result 1.00 0.96 0.16 asserted 1.00
In fixed-horizon tests with four to seven modules, both methods start from identical greedy schedules and receive a 300 s budget. method 0.97 0.92 0.03 asserted 0.97
BSDP obtains lower final SoC than Gurobi on 197 of 200 instances and ties on three, reducing mean final SoC by 17.93%-69.07% across the four size classes. result 1.00 0.97 0.29 asserted 1.00
Geometry sensitivity and ablation studies further clarify the contribution of boundary compression to computational performance. contribution 0.66 0.92 0.04 asserted 0.95
The framework links seat reconfiguration to the timing and operational cost of modular bus decoupling. interpretation 0.84 0.64 0.17 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 1.00

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-13: 1 request, 7,665 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Figures (12)
Figure 1 of the paper
Figure 1. Comparison of seat movement schedules with the same minimum makespan
Figure 2 of the paper
Figure 2. Allowed and prohibited simultaneous CGSP movements. Solid teal arrows indicate feasible
Figure 3 of the paper
Figure 3. Seat movement process in an MB with two modular units and
Figure 4 of the paper
Figure 4. CGSP for MB seat movement (5) When N and m are fixed, we write X = XN,m for brevity. Seats of the same color are indistinguishable, so the state matrix records only the color occupying each vertex rather than the identity of an individual seat. The state-matrix definition assumes that the seat–unit assignment is predetermined and provided as an input to the optimal seat movement problem. Joint optimization of seat–unit assignment and seat movement is beyond the scope of this study. For the illustrative case m = 3, the state of the CGSP in Figure 4a can be represented by the following
Figure 5 of the paper
Figure 5. summarizes how the fixed-T algorithm supports lexicographic makespan–SoC optimization. The outer search starts from a valid integer lower bound on the minimum makespan, denoted by LB in the figure. It tests successive values of T and increases T only after infeasibility at the current value has been established. The first feasible value is T ∗ . BSDP then minimizes SoC at T ∗ to obtain SoC∗ (T ∗ ). The fixed-T procedure may be used in feasibility mode, which can stop after finding a feasible schedule, or in optimization mode, which computes the minimum SoC. The “Minimum SoC” label…
Figure 6 of the paper
Figure 6. Local transfer dynamic programming. The other illustrated successor has value H βi−1,βi i,t+1 (S ′′) = 6 + 3 = 9. It must still be retained: a lower cost at a different state does not imply a better feasible continuation. These numbers illustrate the recurrence and are not experimental results or costs derived from the pictured seat configuration. The diagram shows selected states and transitions, with the displayed incoming alternatives determining the stated values in this example. In the formula strip, Hi,t(S) suppresses the fixed boundary-schedule superscripts, and S G i denote
Figure 7 of the paper
Figure 7. Count-vector DFA for boundary schedules.
Figure 8 of the paper
Figure 8. Chain and paired composition of local transfer costs.
Figure 9 of the paper
Figure 9. Runtime comparison between BSDP and Gurobi.
Figure 10 of the paper
Figure 10. Convergence of the incumbent SoC (left) and lower bound (right) for three selected four
Figure 11 of the paper
Figure 11. Per-instance runtime comparison between BSDP and Gurobi under different rectangular mod
Figure 12 of the paper
Figure 12. Ablation study of BSDP on the 3-module benchmark with 50 instances.

Figures are the authors', reproduced from the paper.

References (76)
  1. [1] Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard , author=. 2011 , publisher= on Pith
  2. [2] Predictive cruise control: Utilizing upcoming traffic signal information for improving fuel economy and reducing trip time , author=. IEEE transactions on control systems technology , volume=. 2010 , publisher= on Pith
  3. [3] Optimally combined headway and timetable reliable public transport system , author=. Transportation Research Part C: Emerging Technologies , volume=. 2018 , publisher= on Pith
  4. [4] Mixed logical dynamical modeling and hybrid model predictive control of public transport operations , author=. Transportation Research Part B: Methodological , volume=. 2018 , publisher= on Pith
  5. [5] Double-battery configuration method for electric bus operation in cold regions , author=. Transportation Research Part E: Logistics and Transportation Review , volume=. 2023 , publisher= on Pith
  6. [6] Optimizing Integrated Eco-Driving Control and Holding Strategy for Real-Time Bus Bunching Mitigation , author=. IEEE Transactions on Intelligent Transportation Systems , year= on Pith
  7. [7] Bus stop-skipping scheme with random travel time , author=. Transportation Research Part C: Emerging Technologies , volume=. 2013 , publisher= on Pith
  8. [8] Autonomous shuttle bus service timetabling and vehicle scheduling using skip-stop tactic , author=. Transportation Research Part C: Emerging Technologies , volume=. 2019 , publisher= on Pith
  9. [9] At-stop control measures in public transport: Literature review and research agenda , author=. Transportation Research Part E: Logistics and Transportation Review , volume=. 2021 , publisher= on Pith
  10. [10] Operational design for shuttle systems with modular vehicles under oversaturated traffic: Discrete modeling method , author=. Transportation Research Part B: Methodological , volume=. 2019 , publisher= on Pith
  11. [11] Operational design for shuttle systems with modular vehicles under oversaturated traffic: Continuous modeling method , author=. Transportation Research Part B: Methodological , volume=. 2020 , publisher= on Pith
  12. [12] A continuous model for designing corridor systems with modular autonomous vehicles enabling station-wise docking , author=. Transportation Science , volume=. 2022 , publisher= on Pith
  13. [13] Operations design of modular vehicles on an oversaturated corridor with first-in, first-out passenger queueing , author=. Transportation Science , volume=. 2021 , publisher= on Pith
  14. [14] Variable-capacity operations with modular transits for shared-use corridors , author=. Transportation Research Record , volume=. 2020 , publisher= on Pith
  15. [15] Alleviating bus bunching via modular vehicles , author=. Transportation Research Part B: Methodological , pages=. 2024 , publisher= on Pith
  16. [16] No time for stopping: A stop-less autonomous modular (SLAM) bus service , author=. Transportation Research Part C: Emerging Technologies , volume=. 2025 , publisher= on Pith
  17. [17] Toward real-time operations of modular-vehicle transit services: From rolling horizon control to learning-based approach , author=. Transportation Research Part C: Emerging Technologies , volume=. 2025 , publisher= on Pith
  18. [18] Operational design for modular electrified transit in corridor areas , author=. Transportation Research Part E: Logistics and Transportation Review , volume=. 2024 , publisher= on Pith
  19. [19] Optimizing a modular autonomous vehicle hub-and-spoke public transportation system: routing, scheduling, and repositioning , author=. Transportation Research Part E: Logistics and Transportation Review , volume=. 2025 , publisher= on Pith
  20. [20] Design of urban transit services using autonomous modular buses , author=. Transportmetrica B: Transport Dynamics , volume=. 2025 , publisher= on Pith
show 56 more
  1. [21] Colored multi-agent path finding: Solving approaches , author=. The International FLAIRS Conference Proceedings , volume= on Pith
  2. [22] Improved anonymous multi-agent path finding algorithm , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume= on Pith
  3. [23] Solving multi-agent target assignment and path finding with a single constraint tree , author=. 2023 International Symposium on Multi-Robot and Multi-Agent Systems (MRS) , pages=. 2023 , organization= on Pith
  4. [24] An algorithm with improved complexity for pebble motion/multi-agent path finding on trees , author=. Journal of Artificial Intelligence Research , volume= on Pith
  5. [25] Pebble motion on graphs with rotations: Efficient feasibility tests and planning algorithms , author=. Algorithmic Foundations of Robotics XI: Selected Contributions of the Eleventh International Workshop on the Algorithmic Foundations of Robotics , pages=. 2015 , organization= on Pith
  6. [26] Coordinating pebble motion on graphs, the diameter of permutation groups, and applications , author= on Pith
  7. [27] Joint optimization of modular autonomous vehicles scheduling and seat allocation for reservation-based travel , author=. Transportation Research Part E: Logistics and Transportation Review , volume=. 2026 , publisher= on Pith
  8. [28] A formal basis for the heuristic determination of minimum cost paths , author=. IEEE transactions on Systems Science and Cybernetics , volume=. 1968 , publisher= on Pith
  9. [29] Introduction to algorithms , author=. 2022 , publisher= on Pith
  10. [30] Massively parallel A* search on a GPU , author=. Proceedings of the AAAI conference on artificial intelligence , volume= on Pith
  11. [31] Optimising modular-autonomous-vehicle transit service employing coupling--decoupling operations plus skip-stop strategy , author=. Transportation Research Part E: Logistics and Transportation Review , volume=. 2024 , publisher= on Pith
  12. [32] A seamless bus network without external transfers using autonomous modular vehicles , author=. Transportation Research Part C: Emerging Technologies , pages=. 2024 , publisher= on Pith
  13. [33] An autonomous modular public transit service , author=. Transportation Research Part C: Emerging Technologies , volume=. 2024 , publisher= on Pith
  14. [34] A survey on demand-responsive public bus systems , author=. Transportation Research Part C: Emerging Technologies , volume=. 2022 , publisher= on Pith
  15. [35] Apollo Minibus , author =. 2023 , url = on Pith
  16. [36] Next Future Transport , author =. 2023 , url = on Pith
  17. [37] Modular transit: Using autonomy and modularity to improve performance in public transportation , author=. Transportation Research Part E: Logistics and Transportation Review , volume=. 2020 , publisher= on Pith
  18. [38] Using deficit function to determine the minimum fleet size of an autonomous modular public transit system , author=. Transportation Research Record , volume=. 2020 , publisher= on Pith
  19. [39] Day-to-day market evaluation of modular autonomous vehicle fleet operations with en-route transfers , author=. Transportmetrica B: Transport Dynamics , volume=. 2021 , publisher= on Pith
  20. [40] Designing corridor systems with modular autonomous vehicles enabling station-wise docking: Discrete modeling method , author=. Transportation Research Part E: Logistics and Transportation Review , volume=. 2021 , publisher= on Pith
  21. [41] Improving flex-route transit services with modular autonomous vehicles , author=. Transportation Research Part E: Logistics and Transportation Review , volume=. 2021 , publisher= on Pith
  22. [42] On the design of an optimal flexible bus dispatching system with modular bus units: Using the three-dimensional macroscopic fundamental diagram , author=. Transportation Research Part B: Methodological , volume=. 2021 , publisher= on Pith
  23. [43] Modular autonomous electric vehicle scheduling for customized on-demand bus services , author=. IEEE Transactions on Intelligent Transportation Systems , volume=. 2023 , publisher= on Pith
  24. [44] Application of modular vehicle technology to mitigate bus bunching , author=. Transportation Research Part C: Emerging Technologies , volume=. 2023 , publisher= on Pith
  25. [45] Joint scheduling and formation design for modular-vehicle transit service with time-dependent demand , author=. Transportation Research Part C: Emerging Technologies , volume=. 2023 , publisher= on Pith
  26. [46] An autonomous modular mobility paradigm , author=. IEEE Intelligent Transportation Systems Magazine , volume=. 2022 , publisher= on Pith
  27. [47] Integrating ridesourcing services with public transit: An evaluation of traveler responses combining revealed and stated preference data , author=. Transportation Research Part C: Emerging Technologies , volume=. 2019 , publisher= on Pith
  28. [48] On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment , author=. Proceedings of the National Academy of Sciences , volume=. 2017 , publisher= on Pith
  29. [49] The who, why, and when of Uber and other ride-hailing trips: An examination of a large sample household travel survey , author=. Transportation Research Part A: Policy and Practice , volume=. 2019 , publisher= on Pith
  30. [50] Vehicle dispatching in modular transit networks: A mixed-integer nonlinear programming model , author=. Transportation Research Part E: Logistics and Transportation Review , volume=. 2021 , publisher= on Pith
  31. [51] Transfer-based customized modular bus system design with passenger-route assignment optimization , author=. Transportation Research Part E: Logistics and Transportation Review , volume=. 2021 , publisher= on Pith
  32. [52] Bus splitting and bus holding: A new strategy using autonomous modular buses for preventing bus bunching , author=. Transportation Research Part A: Policy and Practice , volume=. 2023 , publisher= on Pith
  33. [53] Bunching-Proof Capabilities of Modular Buses: An Analytical Assessment , author=. Transportation Science , year= on Pith
  34. [54] Sinkhorn distances: Lightspeed computation of optimal transport , author=. Advances in neural information processing systems , volume= on Pith
  35. [55] On computing makespan-optimal solutions for generalized sliding-tile puzzles , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume= on Pith
  36. [56] Optimally Solving Colored Generalized Sliding-Tile Puzzles: Complexity and Bounds , author=. International Workshop on the Algorithmic Foundations of Robotics , pages=. 2024 , organization= on Pith
  37. [57] OzoMorph: demonstrating colored multi-agent path finding on real robots , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume= on Pith
  38. [58] Optimal target assignment and path finding for teams of agents , author=. arXiv preprint arXiv:1612.05693 , year= on PithPith's reviewarXiv
  39. [59] Where paths collide: A comprehensive survey of classic and learning-based multi-agent pathfinding , author=. arXiv preprint arXiv:2505.19219 , year= on PithPith's reviewarXiv
  40. [60] Joint timetabling and vehicle formation design for autonomous modular buses under two-level route layout mode , author=. IEEE Transactions on Intelligent Transportation Systems , year= on Pith
  41. [61] Exploiting the flexibility of modular buses in an urban transit system , author=. Transportation Research Part C: Emerging Technologies , volume=. 2025 , publisher= on Pith
  42. [62] Dial-a-ride problem with modular platooning and en-route transfers , author=. Transportation Research Part C: Emerging Technologies , volume=. 2023 , publisher= on Pith
  43. [63] Operationalizing modular autonomous customised buses based on different demand prediction scenarios , author=. Transportmetrica A: Transport Science , volume=. 2025 , publisher= on Pith
  44. [64] Planning two-dimensional trajectories for modular bus enroute docking , author=. Transportation Research Part E: Logistics and Transportation Review , volume=. 2024 , publisher= on Pith
  45. [65] Scheduling strategy for transit routes with modular autonomous vehicles , author=. International Journal of Transportation Science and Technology , volume=. 2021 , publisher= on Pith
  46. [66] Trajectory planning for autonomous modular vehicle docking and autonomous vehicle platooning operations , author=. Transportation Research Part E: Logistics and Transportation Review , volume=. 2022 , publisher= on Pith
  47. [67] Trajectory optimization for autonomous modular vehicle or platooned autonomous vehicle split operations , author=. Transportation research part E: logistics and transportation review , volume=. 2023 , publisher= on Pith
  48. [68] Safety assurance adaptive control for modular autonomous vehicles , author=. Communications in Transportation Research , volume=. 2025 , publisher= on Pith
  49. [69] Optimisation of a new hybrid transit service with modular autonomous vehicles , author=. Transportmetrica A: transport science , volume=. 2024 , publisher= on Pith
  50. [70] Planning for modular-vehicle transit service system: Model formulation and solution methods , author=. Transportation Research Part C: Emerging Technologies , volume=. 2022 , publisher= on Pith
  51. [71] Optimal public transport timetabling with autonomous-vehicle units using coupling and decoupling tactics , author=. Transportmetrica A: Transport Science , volume=. 2025 , publisher= on Pith
  52. [72] Data-driven distributionally robust timetabling and dynamic-capacity allocation for automated bus systems with modular vehicles , author=. Transportation Research Part C: Emerging Technologies , volume=. 2023 , publisher= on Pith
  53. [73] Collaborative optimization of vehicle formation and timetable for modular autonomous bus considering demand uncertainty: A data-driven continuous approximate method , author=. Transportation Research Part E: Logistics and Transportation Review , volume=. 2025 , publisher= on Pith
  54. [74] Finite automata and their decision problems , author=. IBM journal of research and development , volume=. 1959 , publisher= on Pith
  55. [75] Finite-state transducers in language and speech processing , author=. Computational linguistics , volume= on Pith
  56. [76] Learning-based fast alternating direction method of multipliers for multi-agent path finding using temporary variable-fixing , author=. European Journal of Operational Research , year= on Pith

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment