Multi-Informed Trees (MIT*) Planning

• Multi-Informed Trees (MIT*) is a sampling-based motion planner for high-dimensional spaces that uses a pre-solution estimated informed set to guide early search.
• It integrates forward and lazy reverse trees, adaptive sampling, and a reliability-based cost expansion to focus on promising regions while maintaining probabilistic completeness and asymptotic optimality.
• Empirical results demonstrate that MIT* significantly reduces initial solution times and optimal path costs compared to other informed planners in complex, obstacle-rich environments.

Multi-Informed Trees (MIT) is a single-query, sampling-based motion planner for continuous, high-dimensional configuration spaces that addresses a specific limitation of prior informed planners: before a first feasible path is found, standard informed-set methods cannot condition sampling on a finite incumbent cost and therefore revert to global exploration. MIT introduces an estimated informed set before the initial solution, derived from a prior admissible solution cost obtained from lazy reverse-search failure and then expanded by a reliability-dependent factor; after a feasible path exists, it transitions to the standard informed set defined by the current best solution cost. The planner combines a forward tree of valid states and valid edges, a lazy reverse tree whose edges may traverse invalid regions, an adaptive sampler, and length-related adaptive sparse collision checks, while claiming probabilistic completeness and asymptotic optimality (Zhang et al., 29 Aug 2025).

1. Definition and planning setting

MIT* is formulated for optimal path planning in a state space $X \subseteq \mathbb{R}^n$ with obstacle set $X_{\textnormal{obs}}$, collision-free space $X_{\textnormal{free}}$, a start state $\mathbf{x}_{\textnormal{start}}$, and a goal region $X_{\textnormal{goal}}$. A path is a continuous map $\sigma : [0,1] \mapsto X$, and the optimal path is written as

$\begin{split} \sigma^* &= \arg \min_{\sigma \in \Sigma} \left\{ c(\sigma) \,\middle|\, \sigma(0) = \mathbf{x}_{\textnormal{start}}, \sigma(1) \in \mathbf{x}_{\textnormal{goal}}, \right. \ &\qquad\qquad \left. \forall t \in [0, 1], \sigma(t) \in X_{\textnormal{free}} \right\}. \end{split}$

In the reported experiments, the objective is path length (Zhang et al., 29 Aug 2025).

The planner is motivated by the behavior of informed methods that define an informed subset only after a feasible solution exists. With admissible estimates

$$\hat{g}(\mathbf{x}) := \hat{c}(\mathbf{x}_{\textnormal{start}}, \mathbf{x}), \qquad \hat{h}(\mathbf{x}) := \min_{\mathbf{x}_{\textnormal{goal}} \in X_{\textnormal{goal}}}\hat{c}(\mathbf{x}, \mathbf{x}_{\textnormal{goal}}),$$

and

$$\hat{f}(\mathbf{x}) := \hat{g}(\mathbf{x}) + \hat{h}(\mathbf{x}),$$

the standard informed set is

$$X_{\hat{f}} := \{\mathbf{x} \in X \mid \hat{f}(\mathbf{x}) < c_\textnormal{curr}\},$$

where $X_{\textnormal{obs}}$0 is the current solution cost. This mechanism is effective after a feasible solution exists, but before that stage standard informed planners revert to sampling the whole space. MIT* is designed to recover focused search in that pre-solution phase by constructing an estimated informed set from prior admissible costs (Zhang et al., 29 Aug 2025).

The “multi-informed” designation refers to the use of multiple informed subsets or guidance mechanisms over time. MIT* maintains a forward tree $X_{\textnormal{obs}}$1, a reverse tree $X_{\textnormal{obs}}$2, an estimated informed set $X_{\textnormal{obs}}$3 before any feasible solution exists, and the standard informed set $X_{\textnormal{obs}}$4 after a valid solution has been found. This temporal transition between pre-solution and post-solution informed subsets is the central structural distinction of the method (Zhang et al., 29 Aug 2025).

2. Estimated informed sets and the meaning of “multi-informed”

MIT* defines the underlying cost structure through

$X_{\textnormal{obs}}$5

$X_{\textnormal{obs}}$6

and

$X_{\textnormal{obs}}$7

The central innovation is a prior admissible cost available before the first valid path is known. When a forward-search attempt fails full collision checking after connecting the forward tree to the reverse tree, MIT* constructs an admissible initial solution cost

$X_{\textnormal{obs}}$8

where $X_{\textnormal{obs}}$9 is the actual forward-tree cost-to-come to $X_{\textnormal{free}}$0, $X_{\textnormal{free}}$1 is an admissible edge-cost estimate, and $X_{\textnormal{free}}$2 is the admissible cost-to-go from $X_{\textnormal{free}}$3 (Zhang et al., 29 Aug 2025).

Because direct use of this admissible estimate may be too restrictive, MIT* expands it through a reliability term. The reliability parameter is

$X_{\textnormal{free}}$4

the expansion factor is

$X_{\textnormal{free}}$5

and the estimated initial cost is expanded as

$X_{\textnormal{free}}$6

If an estimated informed set already exists and the planner still cannot find a valid path inside it, MIT* enlarges it again through

$X_{\textnormal{free}}$7

The paper notes that the symbol $X_{\textnormal{free}}$8 is reused for both the admissible prior cost and the expanded estimate (Zhang et al., 29 Aug 2025).

Using this expanded cost, MIT* defines the estimated informed set as

$X_{\textnormal{free}}$9

where

$\mathbf{x}_{\textnormal{start}}$0

For path-length minimization, the paper specializes this to a prolate hyperspheroid. Let

$\mathbf{x}_{\textnormal{start}}$1

Then

$\mathbf{x}_{\textnormal{start}}$2

with

$\mathbf{x}_{\textnormal{start}}$3

The conjugate-diameter term is

$\mathbf{x}_{\textnormal{start}}$4

and the ellipse eccentricity is $\mathbf{x}_{\textnormal{start}}$5 (Zhang et al., 29 Aug 2025).

The hyperellipsoid is also written in matrix form as

$\mathbf{x}_{\textnormal{start}}$6

where

$\mathbf{x}_{\textnormal{start}}$7

and

$\mathbf{x}_{\textnormal{start}}$8

Direct sampling uses

$\mathbf{x}_{\textnormal{start}}$9

where $X_{\textnormal{goal}}$0 and

$X_{\textnormal{goal}}$1

For multiple goals $X_{\textnormal{goal}}$2, the estimated informed set becomes

$X_{\textnormal{goal}}$3

with

$X_{\textnormal{goal}}$4

This phased use of $X_{\textnormal{goal}}$5 and $X_{\textnormal{goal}}$6 is the precise sense in which MIT* is “multi-informed” (Zhang et al., 29 Aug 2025).

3. Search architecture, adaptive sampling, and reverse guidance

The planner is organized around two asymmetric structures. The forward tree

$X_{\textnormal{goal}}$7

contains valid states and valid edges, while the reverse tree

$X_{\textnormal{goal}}$8

is lazy and may contain edges that pass through invalid regions. MIT* initializes

$X_{\textnormal{goal}}$9

sets $\sigma : [0,1] \mapsto X$0, forms $\sigma : [0,1] \mapsto X$1, and initializes $\sigma : [0,1] \mapsto X$2, $\sigma : [0,1] \mapsto X$3, and $\sigma : [0,1] \mapsto X$4. It then repeatedly adds samples through

$\sigma : [0,1] \mapsto X$5

builds or updates the reverse tree through

$\sigma : [0,1] \mapsto X$6

and performs forward search while

$\sigma : [0,1] \mapsto X$7

remains true. If returned forward edges collide, MIT* calls

$\sigma : [0,1] \mapsto X$8

and

$\sigma : [0,1] \mapsto X$9

otherwise it inserts valid forward edges into $\begin{split} \sigma^* &= \arg \min_{\sigma \in \Sigma} \left\{ c(\sigma) \,\middle|\, \sigma(0) = \mathbf{x}_{\textnormal{start}}, \sigma(1) \in \mathbf{x}_{\textnormal{goal}}, \right. \ &\qquad\qquad \left. \forall t \in [0, 1], \sigma(t) \in X_{\textnormal{free}} \right\}. \end{split}$0 and later prunes the sampled set (Zhang et al., 29 Aug 2025).

The adaptive sampler has three region-selection modes. If there is no valid solution and no lazy estimate, MIT* samples the full free space through

$\begin{split} \sigma^* &= \arg \min_{\sigma \in \Sigma} \left\{ c(\sigma) \,\middle|\, \sigma(0) = \mathbf{x}_{\textnormal{start}}, \sigma(1) \in \mathbf{x}_{\textnormal{goal}}, \right. \ &\qquad\qquad \left. \forall t \in [0, 1], \sigma(t) \in X_{\textnormal{free}} \right\}. \end{split}$1

If there is no valid solution but an estimated cost exists, it samples the estimated informed set through

$\begin{split} \sigma^* &= \arg \min_{\sigma \in \Sigma} \left\{ c(\sigma) \,\middle|\, \sigma(0) = \mathbf{x}_{\textnormal{start}}, \sigma(1) \in \mathbf{x}_{\textnormal{goal}}, \right. \ &\qquad\qquad \left. \forall t \in [0, 1], \sigma(t) \in X_{\textnormal{free}} \right\}. \end{split}$2

Once a valid solution exists, it samples the standard informed set through

$\begin{split} \sigma^* &= \arg \min_{\sigma \in \Sigma} \left\{ c(\sigma) \,\middle|\, \sigma(0) = \mathbf{x}_{\textnormal{start}}, \sigma(1) \in \mathbf{x}_{\textnormal{goal}}, \right. \ &\qquad\qquad \left. \forall t \in [0, 1], \sigma(t) \in X_{\textnormal{free}} \right\}. \end{split}$3

This yields a procedural transition from full-space exploration, to pre-solution EIS-restricted sampling, to post-solution informed-set optimization (Zhang et al., 29 Aug 2025).

After a preliminary sample $\begin{split} \sigma^* &= \arg \min_{\sigma \in \Sigma} \left\{ c(\sigma) \,\middle|\, \sigma(0) = \mathbf{x}_{\textnormal{start}}, \sigma(1) \in \mathbf{x}_{\textnormal{goal}}, \right. \ &\qquad\qquad \left. \forall t \in [0, 1], \sigma(t) \in X_{\textnormal{free}} \right\}. \end{split}$4 is drawn, MIT* applies an obstacle-based adaptation. If $\begin{split} \sigma^* &= \arg \min_{\sigma \in \Sigma} \left\{ c(\sigma) \,\middle|\, \sigma(0) = \mathbf{x}_{\textnormal{start}}, \sigma(1) \in \mathbf{x}_{\textnormal{goal}}, \right. \ &\qquad\qquad \left. \forall t \in [0, 1], \sigma(t) \in X_{\textnormal{free}} \right\}. \end{split}$5 is valid, it is added directly. If it is invalid, the planner draws a Gaussian-perturbed point $\begin{split} \sigma^* &= \arg \min_{\sigma \in \Sigma} \left\{ c(\sigma) \,\middle|\, \sigma(0) = \mathbf{x}_{\textnormal{start}}, \sigma(1) \in \mathbf{x}_{\textnormal{goal}}, \right. \ &\qquad\qquad \left. \forall t \in [0, 1], \sigma(t) \in X_{\textnormal{free}} \right\}. \end{split}$6 at distance scale $\begin{split} \sigma^* &= \arg \min_{\sigma \in \Sigma} \left\{ c(\sigma) \,\middle|\, \sigma(0) = \mathbf{x}_{\textnormal{start}}, \sigma(1) \in \mathbf{x}_{\textnormal{goal}}, \right. \ &\qquad\qquad \left. \forall t \in [0, 1], \sigma(t) \in X_{\textnormal{free}} \right\}. \end{split}$7; if $\begin{split} \sigma^* &= \arg \min_{\sigma \in \Sigma} \left\{ c(\sigma) \,\middle|\, \sigma(0) = \mathbf{x}_{\textnormal{start}}, \sigma(1) \in \mathbf{x}_{\textnormal{goal}}, \right. \ &\qquad\qquad \left. \forall t \in [0, 1], \sigma(t) \in X_{\textnormal{free}} \right\}. \end{split}$8 is valid, it is added, thereby densifying near obstacle boundaries. If $\begin{split} \sigma^* &= \arg \min_{\sigma \in \Sigma} \left\{ c(\sigma) \,\middle|\, \sigma(0) = \mathbf{x}_{\textnormal{start}}, \sigma(1) \in \mathbf{x}_{\textnormal{goal}}, \right. \ &\qquad\qquad \left. \forall t \in [0, 1], \sigma(t) \in X_{\textnormal{free}} \right\}. \end{split}$9 is also invalid, MIT* searches along the segment $$\hat{g}(\mathbf{x}) := \hat{c}(\mathbf{x}_{\textnormal{start}}, \mathbf{x}), \qquad \hat{h}(\mathbf{x}) := \min_{\mathbf{x}_{\textnormal{goal}} \in X_{\textnormal{goal}}}\hat{c}(\mathbf{x}, \mathbf{x}_{\textnormal{goal}}),$$0 for the first valid point $$\hat{g}(\mathbf{x}) := \hat{c}(\mathbf{x}_{\textnormal{start}}, \mathbf{x}), \qquad \hat{h}(\mathbf{x}) := \min_{\mathbf{x}_{\textnormal{goal}} \in X_{\textnormal{goal}}}\hat{c}(\mathbf{x}, \mathbf{x}_{\textnormal{goal}}),$$1, thereby targeting critical zones such as narrow corridors and wall gaps. The paper labels these cases $$\hat{g}(\mathbf{x}) := \hat{c}(\mathbf{x}_{\textnormal{start}}, \mathbf{x}), \qquad \hat{h}(\mathbf{x}) := \min_{\mathbf{x}_{\textnormal{goal}} \in X_{\textnormal{goal}}}\hat{c}(\mathbf{x}, \mathbf{x}_{\textnormal{goal}}),$$2, $$\hat{g}(\mathbf{x}) := \hat{c}(\mathbf{x}_{\textnormal{start}}, \mathbf{x}), \qquad \hat{h}(\mathbf{x}) := \min_{\mathbf{x}_{\textnormal{goal}} \in X_{\textnormal{goal}}}\hat{c}(\mathbf{x}, \mathbf{x}_{\textnormal{goal}}),$$3, $$\hat{g}(\mathbf{x}) := \hat{c}(\mathbf{x}_{\textnormal{start}}, \mathbf{x}), \qquad \hat{h}(\mathbf{x}) := \min_{\mathbf{x}_{\textnormal{goal}} \in X_{\textnormal{goal}}}\hat{c}(\mathbf{x}, \mathbf{x}_{\textnormal{goal}}),$$4, $$\hat{g}(\mathbf{x}) := \hat{c}(\mathbf{x}_{\textnormal{start}}, \mathbf{x}), \qquad \hat{h}(\mathbf{x}) := \min_{\mathbf{x}_{\textnormal{goal}} \in X_{\textnormal{goal}}}\hat{c}(\mathbf{x}, \mathbf{x}_{\textnormal{goal}}),$$5, and $$\hat{g}(\mathbf{x}) := \hat{c}(\mathbf{x}_{\textnormal{start}}, \mathbf{x}), \qquad \hat{h}(\mathbf{x}) := \min_{\mathbf{x}_{\textnormal{goal}} \in X_{\textnormal{goal}}}\hat{c}(\mathbf{x}, \mathbf{x}_{\textnormal{goal}}),$$6 (Zhang et al., 29 Aug 2025).

The corresponding adaptive-sampler density is defined by an obstacle indicator

$$\hat{g}(\mathbf{x}) := \hat{c}(\mathbf{x}_{\textnormal{start}}, \mathbf{x}), \qquad \hat{h}(\mathbf{x}) := \min_{\mathbf{x}_{\textnormal{goal}} \in X_{\textnormal{goal}}}\hat{c}(\mathbf{x}, \mathbf{x}_{\textnormal{goal}}),$$7

a conditional density

$$\hat{g}(\mathbf{x}) := \hat{c}(\mathbf{x}_{\textnormal{start}}, \mathbf{x}), \qquad \hat{h}(\mathbf{x}) := \min_{\mathbf{x}_{\textnormal{goal}} \in X_{\textnormal{goal}}}\hat{c}(\mathbf{x}, \mathbf{x}_{\textnormal{goal}}),$$8

and

$$\hat{g}(\mathbf{x}) := \hat{c}(\mathbf{x}_{\textnormal{start}}, \mathbf{x}), \qquad \hat{h}(\mathbf{x}) := \min_{\mathbf{x}_{\textnormal{goal}} \in X_{\textnormal{goal}}}\hat{c}(\mathbf{x}, \mathbf{x}_{\textnormal{goal}}),$$9

Since $$\hat{f}(\mathbf{x}) := \hat{g}(\mathbf{x}) + \hat{h}(\mathbf{x}),$$0 lies on the segment $$\hat{f}(\mathbf{x}) := \hat{g}(\mathbf{x}) + \hat{h}(\mathbf{x}),$$1, the paper writes

$$\hat{f}(\mathbf{x}) := \hat{g}(\mathbf{x}) + \hat{h}(\mathbf{x}),$$2

with $$\hat{f}(\mathbf{x}) := \hat{g}(\mathbf{x}) + \hat{h}(\mathbf{x}),$$3, leading to

$$\hat{f}(\mathbf{x}) := \hat{g}(\mathbf{x}) + \hat{h}(\mathbf{x}),$$4

This suggests that the sampler is explicitly biased toward critical zones generated by invalid preliminary samples (Zhang et al., 29 Aug 2025).

Reverse guidance is improved by length-related adaptive sparse collision checks. Rather than using a fixed number of sparse checks for every edge, MIT* updates the sparse-check resolution by

$$\hat{f}(\mathbf{x}) := \hat{g}(\mathbf{x}) + \hat{h}(\mathbf{x}),$$5

and the number of sparse checks on edge $$\hat{f}(\mathbf{x}) := \hat{g}(\mathbf{x}) + \hat{h}(\mathbf{x}),$$6 by

$$\hat{f}(\mathbf{x}) := \hat{g}(\mathbf{x}) + \hat{h}(\mathbf{x}),$$7

Longer edges therefore receive more sparse collision checks. When full forward validation fails, the failure both repairs reverse guidance and yields the prior admissible cost used to create or enlarge the estimated informed set (Zhang et al., 29 Aug 2025).

4. Theoretical properties and asymptotic regime

MIT* explicitly claims probabilistic completeness and asymptotic optimality. The probabilistic-completeness statement is

$$\hat{f}(\mathbf{x}) := \hat{g}(\mathbf{x}) + \hat{h}(\mathbf{x}),$$8

The asymptotic-optimality statement is

$$\hat{f}(\mathbf{x}) := \hat{g}(\mathbf{x}) + \hat{h}(\mathbf{x}),$$9

The paper describes MIT* as an anytime method, and these guarantees are presented in that incremental setting (Zhang et al., 29 Aug 2025).

The asymptotic-optimality argument is based on MIT* using the same Choose Parent and Rewire strategies as EIT* together with an RGG radius condition. The required rewiring radius is written as

$$X_{\hat{f}} := \{\mathbf{x} \in X \mid \hat{f}(\mathbf{x}) < c_\textnormal{curr}\},$$0

where $$X_{\hat{f}} := \{\mathbf{x} \in X \mid \hat{f}(\mathbf{x}) < c_\textnormal{curr}\},$$1 is the number of sampled states, $$X_{\hat{f}} := \{\mathbf{x} \in X \mid \hat{f}(\mathbf{x}) < c_\textnormal{curr}\},$$2 is a tuning parameter, $$X_{\hat{f}} := \{\mathbf{x} \in X \mid \hat{f}(\mathbf{x}) < c_\textnormal{curr}\},$$3 is the Lebesgue measure, and $$X_{\hat{f}} := \{\mathbf{x} \in X \mid \hat{f}(\mathbf{x}) < c_\textnormal{curr}\},$$4 is the unit-ball volume in dimension $$X_{\hat{f}} := \{\mathbf{x} \in X \mid \hat{f}(\mathbf{x}) < c_\textnormal{curr}\},$$5. The paper states that this follows by reference to Lemmas 56, 71, and 72 of Karaman and Frazzoli (Zhang et al., 29 Aug 2025).

In this account, the key theoretical role of the estimated informed set is not to replace the standard asymptotic machinery but to modify finite-time behavior before the first valid path. Once a valid solution exists, MIT* transitions to the standard informed set

$$X_{\hat{f}} := \{\mathbf{x} \in X \mid \hat{f}(\mathbf{x}) < c_\textnormal{curr}\},$$6

so the planner’s long-run regime remains within the usual informed-RGG framework. A plausible implication is that MIT* is best understood as an asymptotically conventional informed-tree planner with a nonconventional pre-solution focusing mechanism (Zhang et al., 29 Aug 2025).

5. Empirical behavior, benchmark results, and robotic applications

MIT* is evaluated in Planner Arena, PDT, MoveIt, and OMPL against RRT-Connect variants, Informed RRT*, BIT, ABIT, AIT, and EIT. The primary objective is path length. Reported common settings include an RGG constant $$X_{\hat{f}} := \{\mathbf{x} \in X \mid \hat{f}(\mathbf{x}) < c_\textnormal{curr}\},$$7, rewire factor $$X_{\hat{f}} := \{\mathbf{x} \in X \mid \hat{f}(\mathbf{x}) < c_\textnormal{curr}\},$$8, batch size $$X_{\hat{f}} := \{\mathbf{x} \in X \mid \hat{f}(\mathbf{x}) < c_\textnormal{curr}\},$$9 for all batch-sorted planners, and Gaussian standard deviation $X_{\textnormal{obs}}$00 set to $X_{\textnormal{obs}}$01 of the maximum extent of $X_{\textnormal{obs}}$02-space. Collision-check resolution is $X_{\textnormal{obs}}$03 in simulation and $X_{\textnormal{obs}}$04 in real-world experiments (Zhang et al., 29 Aug 2025).

The simulation benchmarks comprise Flanking Gap (FG), Random Rectangles (RR), Dividing Walls (DW), and Goal Enclosure (GE), with experiments in $X_{\textnormal{obs}}$05, $X_{\textnormal{obs}}$06, and $X_{\textnormal{obs}}$07, and for GE also $X_{\textnormal{obs}}$08. Metrics include initial median time $X_{\textnormal{obs}}$09, initial median cost $X_{\textnormal{obs}}$10, and final median cost $X_{\textnormal{obs}}$11. MIT* consistently reduces initial solution time relative to EIT*, with representative results as follows. In FG-$X_{\textnormal{obs}}$12, EIT* reports $X_{\textnormal{obs}}$13, $X_{\textnormal{obs}}$14, and $X_{\textnormal{obs}}$15, whereas MIT* reports $X_{\textnormal{obs}}$16, $X_{\textnormal{obs}}$17, and $X_{\textnormal{obs}}$18, an initial-time improvement of $X_{\textnormal{obs}}$19. In FG-$X_{\textnormal{obs}}$20, EIT* reports $X_{\textnormal{obs}}$21, $X_{\textnormal{obs}}$22, and $X_{\textnormal{obs}}$23, while MIT* reports $X_{\textnormal{obs}}$24, $X_{\textnormal{obs}}$25, and $X_{\textnormal{obs}}$26, an improvement of $X_{\textnormal{obs}}$27. In RR-$X_{\textnormal{obs}}$28, EIT* reports $X_{\textnormal{obs}}$29, $X_{\textnormal{obs}}$30, and $X_{\textnormal{obs}}$31, while MIT* reports $X_{\textnormal{obs}}$32, $X_{\textnormal{obs}}$33, and $X_{\textnormal{obs}}$34, an improvement of $X_{\textnormal{obs}}$35. In DW-$X_{\textnormal{obs}}$36, EIT* reports $X_{\textnormal{obs}}$37, $X_{\textnormal{obs}}$38, and $X_{\textnormal{obs}}$39, while MIT* reports $X_{\textnormal{obs}}$40, $X_{\textnormal{obs}}$41, and $X_{\textnormal{obs}}$42, an improvement of $X_{\textnormal{obs}}$43. In GE-$X_{\textnormal{obs}}$44, EIT* reports $X_{\textnormal{obs}}$45, $X_{\textnormal{obs}}$46, and $X_{\textnormal{obs}}$47, while MIT* reports $X_{\textnormal{obs}}$48, $X_{\textnormal{obs}}$49, and $X_{\textnormal{obs}}$50, an improvement of $X_{\textnormal{obs}}$51 (Zhang et al., 29 Aug 2025).

These results are presented as strongest in narrow passages, obstacle-confined spaces, high dimensions, and scenarios where the first feasible path is difficult to obtain. The paper attributes that behavior to the combination of pre-solution estimated informed sets, obstacle-based adaptive sampling, and more reliable lazy reverse guidance through length-related sparse checks. The ablation study supports that interpretation. It compares MIT*-AS (adaptive sampler only), MIT*-EIS, MIT*-SC (sparse checking), and full MIT*. In GE, adaptive sampling helps less because there are fewer narrow-passage bridge opportunities, while EIS helps more by pruning early. In DW, adaptive sampling helps more because narrow passages are abundant. Sparse checking helps more in DW by improving reverse-search precision and reducing costly restarts. Full MIT* performs best, suggesting that the components are complementary (Zhang et al., 29 Aug 2025).

The real-world evaluations use the DARKO base-manipulator robot in Beer Barrel-ENV, Shelf-ENV, and Kitchen-ENV, each over $X_{\textnormal{obs}}$52 runs. In Beer Barrel-ENV, MIT* achieves $X_{\textnormal{obs}}$53 success and median cost $X_{\textnormal{obs}}$54, versus EIT* at $X_{\textnormal{obs}}$55 and $X_{\textnormal{obs}}$56, and AIT* at $X_{\textnormal{obs}}$57 and $X_{\textnormal{obs}}$58. In Shelf-ENV, MIT* achieves $X_{\textnormal{obs}}$59 success and median cost $X_{\textnormal{obs}}$60, versus EIT* at $X_{\textnormal{obs}}$61 and $X_{\textnormal{obs}}$62, and AIT* at $X_{\textnormal{obs}}$63 and $X_{\textnormal{obs}}$64. In Kitchen-ENV, MIT* achieves $X_{\textnormal{obs}}$65 success and median cost $X_{\textnormal{obs}}$66, versus EIT* at $X_{\textnormal{obs}}$67 and $X_{\textnormal{obs}}$68, and AIT* at $X_{\textnormal{obs}}$69 and $X_{\textnormal{obs}}$70. Two $X_{\textnormal{obs}}$71 s dynamic replanning tasks are also reported: in the horizontal-movement block task, MIT* obtains average cost $X_{\textnormal{obs}}$72 and success $X_{\textnormal{obs}}$73, compared with EIT* at $X_{\textnormal{obs}}$74 and $X_{\textnormal{obs}}$75, and AIT* at $X_{\textnormal{obs}}$76 and $X_{\textnormal{obs}}$77; in the two vertical-movement blocks task, MIT* obtains success $X_{\textnormal{obs}}$78 and median cost $X_{\textnormal{obs}}$79, compared with EIT* at $X_{\textnormal{obs}}$80 and $X_{\textnormal{obs}}$81, and AIT* at $X_{\textnormal{obs}}$82 and $X_{\textnormal{obs}}$83 (Zhang et al., 29 Aug 2025).

6. Position within informed-tree research and common misconceptions

MIT* belongs to the informed-tree lineage associated with Batch Informed Trees (BIT*) and Adaptively Informed Trees (AIT*), but it is not interchangeable with them. BIT* established the general paradigm of heuristic search over batches of samples interpreted as an implicit random geometric graph, with an informed subset

$X_{\textnormal{obs}}$84

defined by the incumbent cost and with almost-sure asymptotic optimality in the standard informed-RGG sense (Gammell et al., 2017). AIT* extended that framework through an asymmetric bidirectional architecture in which a reverse search estimates a problem-specific heuristic and a forward search performs expensive edge validation, while remaining almost-surely asymptotically optimal (Strub et al., 2020). MIT* inherits the same broad design space—forward/reverse asymmetry, batch-informed planning, lazy reverse guidance, and asymptotic-optimality-style radius conditions—but distinguishes itself by introducing an estimated informed set before the first valid path exists (Zhang et al., 29 Aug 2025).

The terminology can be misleading because several later planners use similar suffixes without introducing MIT*. “Informed Steiner Tree*” introduces IST* for multi-goal path finding and does not literally use the name Multi-Informed Trees (Chandak et al., 2022). “Task and Motion Informed Trees” introduces TMIT* for integrated task and motion planning and likewise does not define MIT* (Thomason et al., 2022). Other neighboring variants include Flexible Informed Trees (FIT*), which changes batch-size policy (Zhang et al., 2023); Fully Connected Informed Trees (FCIT*), which removes nearest-neighbour structures by searching fully connected sampled graphs (Wilson et al., 2024); Just-in-Time Informed Trees (JIT*), which introduces local just-in-time edge and sample refinement (Cai et al., 27 Jan 2026); and Genetic Informed Trees (GIT*), which learns a richer reverse-search heuristic via reinforced genetic programming (Zhang et al., 28 Aug 2025). A common misconception is therefore that MIT* is merely another name for AIT*, IST*, or TMIT*; the literature summarized here indicates that MIT* is a distinct algorithmic proposal centered on pre-solution estimated informed sets rather than a renaming of those earlier methods.

Within that broader family, MIT* is most naturally characterized as an anytime, asymptotically optimal, probabilistically complete informed-tree planner whose novel contribution is front-loaded. Its principal intervention occurs before the first feasible solution, when standard informed planners lose their defining restriction and must resample globally. By deriving a prior admissible cost from failed lazy reverse-search attempts, expanding it via a reliability term, and sampling within the resulting estimated informed set, MIT* turns the pre-solution phase into an informed phase as well. This suggests a specific interpretation of its historical role: not a replacement for BIT*- or AIT*-style informed planning, but a refinement of the stage at which informed restriction first becomes available (Zhang et al., 29 Aug 2025).