Fact-checked by Grok 2 weeks ago

Chebyshev distance

The Chebyshev distance, also known as the maximum metric or L^\infty metric, is a metric defined on a vector space where the distance between two points is the greatest of the absolute differences along any coordinate dimension.^[1] For two points \mathbf{x} = (x_1, x_2, \dots, x_n) and \mathbf{y} = (y_1, y_2, \dots, y_n) in n-dimensional Euclidean space, it is mathematically expressed as d(\mathbf{x}, \mathbf{y}) = \max_{i=1,\dots,n} |x_i - y_i|.^[2] This distance arises as the limiting case of the Minkowski distance when the order p approaches infinity, specifically d_p(\mathbf{x}, \mathbf{y}) = \left( \sum_{i=1}^n |x_i - y_i|^p \right)^{1/p} with p \to \infty.^[2] Named after the 19th-century Russian mathematician Pafnuty Chebyshev, who made foundational contributions to approximation theory and probability, the metric honors his work on uniform approximations and bounds, though the distance concept itself stems from broader developments in metric geometry.^[3] As a norm-induced metric, the Chebyshev distance satisfies the properties of a metric space, including non-negativity, symmetry, and the triangle inequality: d(\mathbf{x}, \mathbf{z}) \leq d(\mathbf{x}, \mathbf{y}) + d(\mathbf{y}, \mathbf{z}).^[2] It differs from other common distances like the Euclidean (L^2) or Manhattan (L^1) metrics by emphasizing the dominant coordinate difference rather than a sum or root of sums, making it particularly suitable for scenarios where the maximum deviation is critical, such as in uniform error bounds or grid-based movements allowing diagonals.^[4] In practical applications, it models the minimum moves a king needs on a chessboard, as the king can shift equally in any direction including diagonals, equating to the maximum rank or file difference between squares.^[4] The Chebyshev distance finds extensive use in computer science and data analysis, including k-nearest neighbors (k-NN) algorithms for classification tasks where maximum feature differences drive similarity judgments, and in polarimetric synthetic aperture radar (PolSAR) image analysis via variants like the divergence-Chebyshev distance for texture discrimination.^[5] It also appears in artificial intelligence planning, such as tabu search methods for optimization problems requiring bounds on maximum deviations, and in computer vision for measuring distances in discrete grids like pixel arrays.^[6] Generalizations extend it to fuzzy sets and statistical descriptions, where it supports proximity measures between modalities in high-dimensional data.^[7]

Definition and Interpretation

Mathematical Definition

The Chebyshev distance, also known as the maximum metric or L^\infty metric, between two points in an n-dimensional real coordinate space is defined as the greatest of the absolute differences along any coordinate dimension.^[2] For points \mathbf{x} = (x_1, \dots, x_n) and \mathbf{y} = (y_1, \dots, y_n), it is given by the formula

d_\infty(\mathbf{x}, \mathbf{y}) = \max_{i=1,\dots,n} |x_i - y_i|.

^[8] This distance corresponds to the L^\infty-norm (or supremum norm) of the vector difference \mathbf{x} - \mathbf{y}, expressed as \|\mathbf{x} - \mathbf{y}\|_\infty = \max_i |x_i - y_i|.^[9] The notation d_\infty emphasizes its relation to the limiting case of the Minkowski distance as the order p approaches infinity.^[2] In the specific case of two-dimensional space, the Chebyshev distance between points (x_1, y_1) and (x_2, y_2) simplifies to

d_\infty((x_1, y_1), (x_2, y_2)) = \max(|x_1 - x_2|, |y_1 - y_2|).

^[10] For instance, the distance between the origin (0,0) and the point (3,4) is \max(|3-0|, |4-0|) = 4.

Geometric Interpretation

In two dimensions, the Chebyshev distance defines a unit "circle"—the locus of points at distance 1 from the origin—as a square with sides parallel to the coordinate axes, extending from -1 to 1 along both x and y directions, resulting in a side length of 2. The vertices of this square lie at (1,1), (1,-1), (-1,1), and (-1,-1). For a general radius r, the shape scales to a square with side length $2r. This square geometry arises because the distance is governed by the maximum absolute difference in coordinates, constraining points within the bounds where both coordinates' deviations do not exceed r.^[11]^[12] In three dimensions, the corresponding "sphere" of radius r under the Chebyshev distance is a cube aligned with the coordinate axes, with each side measuring $2r and faces perpendicular to the axes. The unit cube, for r=1, occupies the region [-1,1]^3. This cubic form reflects the metric's emphasis on the largest coordinate deviation, bounding the space where no single dimension exceeds the radius in absolute value.^[12] The pattern generalizes to higher finite dimensions, where the unit ball is an n-dimensional hypercube with side length 2, specifically the set \prod_{i=1}^n [-1,1]. In infinite-dimensional settings, such as the space of bounded real sequences equipped with the supremum norm (equivalent to the Chebyshev distance), the unit ball takes the form of an infinite hypercube, comprising all sequences where each component lies in [-1,1].^[13] A practical visualization of the Chebyshev distance appears in chess, where the shortest path for a king—which can move one square in any direction (horizontally, vertically, or diagonally)—from one position to another equals the Chebyshev distance, computed as the maximum of the absolute differences in row and column indices. This equates to the minimum number of king moves required on an empty board.^[2]

Properties

As a Metric

The Chebyshev distance d_\infty(\mathbf{x}, \mathbf{y}) = \max_{1 \leq i \leq n} |x_i - y_i| on \mathbb{R}^n satisfies the axioms of a metric space.^[14] Non-negativity follows from the definition, as the maximum of non-negative absolute values is non-negative: d_\infty(\mathbf{x}, \mathbf{y}) \geq 0 for all \mathbf{x}, \mathbf{y} \in \mathbb{R}^n. Equality holds if and only if d_\infty(\mathbf{x}, \mathbf{y}) = 0, which occurs precisely when |x_i - y_i| = 0 for all i, or \mathbf{x} = \mathbf{y}.^[14] Symmetry is immediate, since |x_i - y_i| = |y_i - x_i| for each i, so d_\infty(\mathbf{x}, \mathbf{y}) = d_\infty(\mathbf{y}, \mathbf{x}).^[14] The triangle inequality holds because, for each coordinate i, the real numbers satisfy |x_i - z_i| \leq |x_i - y_i| + |y_i - z_i| by the standard triangle inequality on \mathbb{R}. Thus,

|x_i - z_i| \leq |x_i - y_i| + |y_i - z_i| \leq \max_{1 \leq j \leq n} |x_j - y_j| + \max_{1 \leq k \leq n} |y_k - z_k| = d_\infty(\mathbf{x}, \mathbf{y}) + d_\infty(\mathbf{y}, \mathbf{z}).

Taking the maximum over i yields d_\infty(\mathbf{x}, \mathbf{z}) \leq d_\infty(\mathbf{x}, \mathbf{y}) + d_\infty(\mathbf{y}, \mathbf{z}).^[14] The topology induced by the Chebyshev distance on \mathbb{R}^n is the standard Euclidean topology, as all norms on a finite-dimensional space are equivalent and generate the same open sets. In this topology, compact sets are precisely the closed and bounded subsets, by the Heine-Borel theorem. Convergence of sequences under this metric coincides with componentwise convergence (or uniform convergence of coordinates), ensuring that limits preserve the usual properties of sequences in \mathbb{R}^n.^[15] The Chebyshev distance is the metric induced by the \ell^\infty-norm, \|\mathbf{x}\|_\infty = \max_{1 \leq i \leq n} |x_i|, via d_\infty(\mathbf{x}, \mathbf{y}) = \|\mathbf{x} - \mathbf{y}\|_\infty. Since every finite-dimensional normed space over \mathbb{R} is complete, \mathbb{R}^n is a complete metric space under the Chebyshev distance.^[16]

Relations to Other Metrics

The Chebyshev distance, also known as the L_\infty metric, satisfies specific inequalities with respect to the Euclidean (L_2) and Manhattan (L_1) distances in n-dimensional space. For any two points \mathbf{x}, \mathbf{y} \in \mathbb{R}^n, the distances obey d_\infty(\mathbf{x}, \mathbf{y}) \leq d_2(\mathbf{x}, \mathbf{y}) \leq \sqrt{n} \, d_\infty(\mathbf{x}, \mathbf{y}) and d_\infty(\mathbf{x}, \mathbf{y}) \leq d_1(\mathbf{x}, \mathbf{y}) \leq n \, d_\infty(\mathbf{x}, \mathbf{y}), where equality in the left inequalities holds when the difference vector \mathbf{x} - \mathbf{y} has at most one nonzero component (axis-aligned direction) and equality in the right inequalities holds when all components of \mathbf{x} - \mathbf{y} have equal absolute value.^[17] The Chebyshev distance emerges as the limiting case of the more general Minkowski distance d_p(\mathbf{x}, \mathbf{y}) = \left( \sum_{i=1}^n |x_i - y_i|^p \right)^{[1](/page/1)/p} as the order p \to \infty. In this limit, the Minkowski distance converges to the maximum coordinate difference, yielding d_p(\mathbf{x}, \mathbf{y}) \to d_\infty(\mathbf{x}, \mathbf{y}).^[18] In discrete grid spaces, such as those used in cellular automata or image processing, the Chebyshev distance of 1 defines the Moore neighborhood, which includes eight adjacent cells in 2D (allowing diagonal connections, corresponding to 8-connected paths). This contrasts with the Manhattan distance of 1, which defines the von Neumann neighborhood of four adjacent cells (axis-aligned only, corresponding to 4-connected paths).^[19] Compared to the Euclidean distance, the Chebyshev distance always underestimates or equals it, with d_\infty(\mathbf{x}, \mathbf{y}) \leq d_2(\mathbf{x}, \mathbf{y}) and strict inequality when the difference vector has more than one nonzero component, such as in diagonal directions (e.g., for unit steps, d_\infty = 1 < \sqrt{2} = d_2). Equality holds in axis-aligned directions.^[17]

Applications

In Discrete and Computational Contexts

In discrete settings, such as integer grids and computational algorithms, the Chebyshev distance serves as a fundamental metric for measuring separation between points where movement allows diagonal steps equivalent to orthogonal ones. This makes it particularly suitable for applications involving grid-based structures, where the distance equals the maximum coordinate difference, facilitating straightforward calculations on lattices like those in computer graphics or simulations.^[20] A prominent application appears in chess programming, where the Chebyshev distance determines the minimum number of moves a king requires to reach from one square to another on an empty board, as the king can move to any adjacent square, including diagonally. For instance, the distance between squares f6 (coordinates assuming a=1, h=8, ranks 1-8) and e2 is 4, reflecting the maximum of the horizontal (1 file) and vertical (4 rank) differences.^[21] In pathfinding algorithms for video games, especially those with grid-based environments allowing eight-directional movement, the Chebyshev distance provides an admissible and consistent heuristic for informed search methods like A*, estimating the cost to move between tiles accurately without under- or overestimating paths. This is evident in genres such as roguelikes, where it optimizes AI navigation by treating diagonal and straight moves as equal cost, reducing computational overhead in dynamic maps.^[22]^[23] Within machine learning, the Chebyshev distance is employed in k-nearest neighbors (kNN) classification tasks, particularly when the maximum difference across features is the dominant concern, such as in datasets where uniform scaling across dimensions highlights outlier impacts in a single coordinate. Studies comparing distance metrics in kNN have shown Chebyshev yielding high accuracy in classification, outperforming Euclidean or Manhattan in scenarios like star categorization, where it emphasizes the largest feature deviation for neighbor selection.^[24]^[25] In image processing, Chebyshev distance defines structuring elements as square-shaped "balls" (e.g., diamonds in Manhattan but squares here), enabling morphological operations like dilation and erosion for tasks such as edge detection and noise removal. These operations probe the image with Chebyshev-based kernels to expand or shrink regions, preserving square-like structures in binary or grayscale images more effectively than circular elements in grid discretizations.^[26]^[27] Computationally, the Chebyshev distance in integer grids or n-dimensional vectors is highly efficient, requiring only O(n time to evaluate by computing absolute differences and selecting the maximum, which suits real-time applications in large-scale discrete data without needing complex optimizations.^[3]

In Continuous and Engineering Contexts

In warehouse logistics, the Chebyshev distance is applied to optimize paths for overhead cranes, where movement occurs simultaneously along multiple axes, making travel time proportional to the maximum coordinate deviation rather than the sum or Euclidean length. This metric minimizes the worst-case deviation in x and y coordinates, enabling efficient retrieval and storage operations in automated storage and retrieval systems (AS/RS). For instance, crane scheduling algorithms model inter-location distances using the Chebyshev norm to reduce operational delays, as the crane's speed is limited by the slower axis during parallel motion.^[28]^[29] In computer-aided manufacturing (CAM), particularly for CNC and laser cutting processes, the Chebyshev distance facilitates tool path planning by minimizing the maximum positional error across coordinates, ensuring uniform accuracy in machining free-form surfaces. This approach is valuable in scenarios where air moves between cuts must account for non-linear travel times, modeled via the Chebyshev metric to approximate the greatest axis displacement and optimize sequencing. By prioritizing the supremum norm, CAM systems achieve balanced error distribution, reducing overcuts or undercuts in high-precision applications like sheet metal fabrication.^[30]^[31] Robotics motion planning employs the Chebyshev distance to prioritize worst-case deviation in obstacle avoidance, especially in multi-objective environments where paths must balance multiple constraints such as energy and clearance. This metric defines safety buffers as the maximum allowable separation in any dimension, allowing planners to generate collision-free trajectories that hedge against the largest potential deviation. In UAV and mobile robot systems, integrating Chebyshev-based cost functions ensures robust navigation by automatically elevating the highest-risk objective, such as proximity to barriers, in dynamic settings.^[32]^[33] In signal processing, the Chebyshev norm underpins filter design by bounding the maximum error in the frequency response, achieving equiripple approximations that minimize the L∞ norm deviation from the ideal passband and stopband characteristics. This worst-case error control is central to Chebyshev FIR and IIR filters, where the Remez algorithm iteratively exchanges error extrema to ensure uniform ripple, providing sharper transitions than least-squares methods at the cost of controlled peak deviation. Such designs are critical for applications requiring predictable maximum distortion, like audio equalization or biomedical signal denoising.^[34]^[35] Post-2005 advancements in autonomous vehicle systems, including 2020s advanced driver-assistance systems (ADAS), incorporate the Chebyshev distance in path planning to establish safe maximum-distance buffers around obstacles, enhancing collision avoidance in off-road and urban scenarios. By using this metric as a heuristic in A* variants, planners compute efficient trajectories that maintain a uniform safety margin across lateral and longitudinal deviations, adapting to real-time sensor data for robust navigation. This approach supports risk-aware decision-making, where the maximum buffer violation is minimized to ensure compliance with safety standards in dynamic environments.^[36]^[37]

Generalizations

To Vector and Normed Spaces

The Chebyshev distance generalizes to the n-dimensional real vector space \mathbb{R}^n via the formula

d_\infty(\mathbf{x}, \mathbf{y}) = \max_{1 \leq i \leq n} |x_i - y_i|

for points \mathbf{x} = (x_1, \dots, x_n) and \mathbf{y} = (y_1, \dots, y_n) in \mathbb{R}^n.^[38] This definition arises as the metric induced by the \ell^\infty norm on \mathbb{R}^n, given by \|\mathbf{x}\|_\infty = \max_{1 \leq i \leq n} |x_i|.^[39] The corresponding unit ball, consisting of all vectors \mathbf{x} with \|\mathbf{x}\|_\infty \leq 1, forms the n-dimensional hypercube [-1, 1]^n, whose faces are aligned with the coordinate axes.^[39] For instance, in \mathbb{R}^3, the Chebyshev distance between the points (1, 2, 3) and (4, 0, 5) is \max(|1-4|, |2-0|, |3-5|) = \max(3, 2, 2) = 3. This metric on \mathbb{R}^n generates the standard product topology on the finite Cartesian product \prod_{i=1}^n \mathbb{R}, where each factor \mathbb{R} carries its usual topology.^[38] Specifically, the open balls in the Chebyshev metric serve as a basis for the product topology, ensuring that neighborhoods in \mathbb{R}^n correspond to simultaneous control over coordinates in a uniform manner across dimensions. The Chebyshev distance further extends to infinite-dimensional sequence spaces through the \ell^\infty space of all bounded real sequences (a_k)_{k \in \mathbb{N}}, defined as those sequences satisfying \sup_{k \in \mathbb{N}} |a_k| < \infty.^[40] The associated norm is \|(a_k)\|_\infty = \sup_{k \in \mathbb{N}} |a_k|, and the induced metric takes the form

d((a_k), (b_k)) = \sup_{k \in \mathbb{N}} |a_k - b_k|.

^[41] This construction requires boundedness of the sequences, as unbounded sequences would yield an infinite supremum, rendering the distance undefined within the space.^[40] The \ell^\infty space thus captures uniform bounded variation across infinitely many coordinates, analogous to the finite-dimensional case but with the supremum over a countable index set.

In Approximation and Functional Analysis

In the context of functional analysis, the Chebyshev distance arises naturally as the metric induced by the uniform norm on the space of continuous functions C[a, b], defined as \|f\|_\infty = \sup_{x \in [a, b]} |f(x)| for f \in C[a, b], with the distance between two functions given by d(f, g) = \|f - g\|_\infty.^[42] This norm, also known as the Chebyshev norm, measures the maximum deviation between functions over the interval, providing a complete metric space structure on C[a, b], which is a Banach space under this metric.^[43] The completeness ensures that Cauchy sequences of continuous functions converge uniformly to a continuous limit, facilitating rigorous error analysis in approximation problems.^[44] A key connection exists between this distance and approximation theory, particularly through minimax approximation, where the goal is to find the best uniform approximation of a continuous function f by elements from a subspace, such as polynomials, minimizing the maximum error \|f - p\|_\infty. Chebyshev polynomials play a central role here, as they achieve the minimal possible maximum deviation among all monic polynomials of a given degree on [-1, 1], equaling $1/2^{n-1} for degree n. This property underpins the characterization of best approximations via the equioscillation theorem, where the error attains its maximum magnitude with alternating signs at n+2 points. Pafnuty Chebyshev (1821–1894) laid the foundations for this minimax theory in the mid-19th century through his work on interpolation and polynomial approximation, directly linking the uniform norm to optimal error minimization.^[45]^[46] In modern numerical analysis, the Chebyshev distance via the uniform norm is employed to derive tight error bounds in computational simulations, such as those involving function approximations on bounded domains. For instance, recent studies on sampling projections use sup-norm error estimates to quantify convergence rates in high-dimensional approximations, achieving bounds of order O(1/\sqrt{m}) for m samples in certain reproducing kernel Hilbert spaces embedded in C[a, b]. Similarly, advancements in Chebyshev polynomial approximations for functions of bounded variation provide optimal error rates scaling as O(1/n) for degree-n approximations, enhancing reliability in simulations of partial differential equations and signal processing tasks throughout the 2020s.

References

[1]
Chebyshev distance | EPFL Graph Search
In mathematics, Chebyshev distance (or Tchebychev distance), maximum metric, or L∞ metric is a metric defined on a vector space where the distance between two ...
[2]
Chebyshev Distance - an overview | ScienceDirect Topics
Chebyshev Distance is a metric in a vector space where the distance between two vectors is determined by the greatest difference along any coordinate dimension.
[3]
Understanding Chebyshev Distance: A Comprehensive Guide
Sep 5, 2024 · Chebyshev distance measures the maximum difference along any single dimension, while Euclidean distance calculates the straight-line distance ...What is Chebyshev Distance? · Grid interpretation · Mathematical Properties of...
[4]
[PDF] Taxicab Geometry and beyond
The Chebyshev distance be- tween two spaces on a chess board gives the minimum num- ber of moves a king requires to move between them. This is.
[5]
https://www.sciencedirect.com/science/article/pii/S1568494621001174
[6]
https://www.sciencedirect.com/science/article/pii/B9780128147610000046
[7]
Generalized Chebyshev distance and fuzzy statistical description
In the following write up, we are going to show how we can construct a measure of the proximity between two modalities of characters from this distance notion ...
[8]
[PDF] CH5: Clustering Theory and Spectral Clustering
• Chebyshev distance (L∞-norm): the maximum absolute magnitude of the difference between the co- ordinates of two points in any dimension: d(x, y) = max i ...
[9]
Distance Metrics - Math.NET Numerics
The Chebyshev distance is the L∞ L ∞ -norm of the difference, a special case of the Minkowski distance where p goes to infinity. It is also known as Chessboard ...
[10]
[PDF] Lab 4: An Interactive 3D Distance Calculator
Sep 20, 2012 · A third way to measure distance is known as the Chebyshev distance3. ... Calculate and display the Chebyshev distance between the two points.
[11]
Why is the norm ball a square in $\,\mathbb R^2\,$ under $\,l^\infty ...
Sep 14, 2015 · The ℓ∞ norm of a point in R2 is just the maximum of the two coordinates, and the square encloses all points where neither of the two coordinates ...Unit Ball with p-norm - convex analysis - Math Stack ExchangeAbout $l_2$ and $l_\infty$ Norms - Mathematics Stack ExchangeMore results from math.stackexchange.comMissing: shape | Show results with:shape
[12]
Volume unit ball in Lp space (Lebesgue p-norm)
Jul 2, 2010 · This is as we'd expect since the unit “ball” in the infinity norm is a cube, two units wide on each side.
[13]
[PDF] Cubature, Approximation, and Isotropy in the Hypercube - People
8 From inside out, the 1-, 2-, and ∞-norm unit balls, shown in two dimensions as a schematic for d dimensions. The sections in the positive orthant correspond ...<|control11|><|separator|>
[14]
Chebyshev Distance on Real Vector Space is Metric - ProofWiki
Dec 1, 2020 · Theorem. The Chebyshev distance on Rn: ∀x,y∈Rn:d∞(x,y):=nmaxi=1|xi−yi|. is a metric. Proof 1. This is an instance of the Chebyshev distance ...
[15]
all norms on finite-dimensional vector spaces are equivalent
Mar 22, 2013 · There is only one norm induced topology on a finite dimensional vector space. This means that on such a vector space, we need not worry about what norm we use.
[16]
every finite dimensional normed vector space is a Banach space
Mar 22, 2013 · Theorem 1. Every finite dimensional normed vector space is a Banach space . Proof. Suppose (V ...<|separator|>
[17]
[PDF] Chapter 4 Vector Norms and Matrix Norms - UPenn CIS
Before giving examples of matrix norms, we need to re- view some basic definitions about matrices.
[18]
[PDF] 1 Norms and Vector Spaces
Unlike finite-dimensional spaces, such inequalities do not hold between any pair of norms. So minimizing the 2-norm is very different from minimizing the ∞-norm ...
[19]
A generalized neighborhood for cellular automata - ScienceDirect.com
Mar 1, 2017 · A generalized neighborhood for d-dimensional cellular automata is introduced; it spans the range from von Neumann's to Moore's neighborhood using a parameter.
[20]
Chebyshev distance - GeeksforGeeks
Jul 26, 2025 · Chebyshev Distance is a metric used to calculate the distance between two points in a space where movement can occur in any direction ...
[21]
Distance - Chessprogramming wiki
The so called Chebyshev distance is the minimal number of king moves between those squares on the otherwise empty board. The so called Manhattan- or Taxi- ...
[22]
[PDF] A Review on Informed Search Algorithms for Video Games Pathfinding
To optimize A*, they apply a Chebyshev distance as its heuristic and add vertex penalties to shorten the time in the search technique. Besides, they also ...
[23]
[PDF] Review of Various A* Pathfinding Implementations in Game ...
Chebyshev distance is a variance of diagonal distance that taking an assumption that the cost that needed by an agent to a diagonal movement is equal to the ...
[24]
Comparison of Distance Models on K-Nearest Neighbor Algorithm in ...
The Chebyshev model has the highest levels of accuracy compared to the other three distance models with an average accuracy value of 95.49%, ...
[25]
Study of distance metrics on k - nearest neighbor algorithm for star ...
In this paper, we have analyzed the accuracy of the kNN algorithm by considering various distance metrics and the range of k values. Minkowski, Euclidean, ...
[26]
Morphology of Shapes - Examples of ImageMagick Usage
The whole process actually depends on the definition of a 'Structuring Element ... Chebyshev Distance, and the too-large Manhattan Distance. However in ...
[27]
[PDF] Mathematical Morphology in Machine Learning
iteration when compared to the Chebyshev distance. ... A morphological reconstruction operation is then performed on image G using the structuring element B and ...
[28]
[PDF] Chapter 1. Introduction - Logistics Systems Design
Finally, the Chebyshev norm is also called the simultaneous travel distance and is used with material handling equipment such as AS/RS and bridge cranes, where ...
[29]
[PDF] Crane scheduling for end-of-aisle picking - EconStor
Jun 14, 2022 · Further note that crane travel in an ASRS typically follows a Chebyshev (maximum) metric, i.e., the distance between two points (𝑥0, 𝑦0) and (𝑥 ...
[30]
A review of cutting path algorithms for laser cutters - ResearchGate
May 16, 2025 · ... tool path planning specifies the exact tool. movements between and ... Chebyshev distance. metric has to be adopted. The Chebyshev aspect ...
[31]
[PDF] A review of cutting path algorithms for laser cutters - Lirias
The non-linearity in the air move times, as a function of the Chebyshev distance, is usually piecewise-linearly ... [45] model a machining tool path problem as a ...
[32]
Prioritising paths: An improved cost function for local path planning ...
Aug 2, 2023 · Considering the single worst objective in the Chebyshev distance allows the path planner to automatically consider this objective as the ...
[33]
Path planning and collision avoidance methods for distributed multi ...
Sep 30, 2022 · Therefore, we combine Euclidean distance and Chebyshev distance to design a heuristic function that is more consistent with our BAJPSA* ...
[34]
Optimal FIR Digital Filter Design | Spectral Audio Signal Processing
The optimal Chebyshev FIR filter can often be found effectively using the Remez multiple exchange algorithm (typically called the Parks-McClellan algorithm when ...
[35]
Optimal Chebyshev FIR Filters - Stanford CCRMA
A filter in the audio signal processing context is any operation ... $ \ensuremath{L_\infty}$ norm of the (possibly weighted) frequency-response error.
[36]
Real-time path planning for autonomous vehicle off-road driving - NIH
Jul 24, 2024 · For a movement in eight directions the Chebyshev distance is applied. In order to adapt A* algorithm to path planning for off-road navigation, ...
[37]
Trajectory planning and tracking control in autonomous driving system
This review article present perception and localization of vehicle using sensor technology including Path planning and decision making process. Focused on ...
[38]
[PDF] Section 20. The Metric Topology
Jul 2, 2016 · Theorem 20.3. The topologies on Rn induced by the Euclidean metric d and the square metric ρ are the same as the product topology on Rn.
[39]
L^infty-Norm -- from Wolfram MathWorld
A vector norm defined for a vector x=[x_1; x_2; |; x_n], with complex entries by |x|_infty=max_(i)|x_i|. The vector norm |x|_infty of the vector x is ...Missing: interpretation | Show results with:interpretation
[40]
L^infty-Space -- from Wolfram MathWorld
The space called L^infty (ell-infinity) generalizes the L-p-spaces to p=infty. No integration is used to define them, and instead, the norm on L^infty is ...
[41]
245B, notes 3: L^p spaces
- **l^∞ Norm Definition**: A function $ f: X \to \mathbb{C} $ is essentially bounded if there exists an $ M $ such that $ |f(x)| \leq M $ almost everywhere; the $ L^\infty $ norm is the least such $ M $.
[42]
[PDF] Best Uniform Approximation to Continuous Functions from Finite ...
Sep 9, 2014 · In the 1850's P. L. Chebyshev considered best uniform approximations to a function f : [0, 1] → R from the space of real polynomial ...
[43]
[PDF] Chapter 2 Approximation problem - Goethe-Universität Frankfurt
In this chapter we study the best approximation problem in Hilbert and Banach spaces. In the focus are the questions of existence and uniqueness. The metric ...
[44]
CHEBYSHEV SETS - Cambridge University Press & Assessment
Nov 11, 2014 · A Chebyshev set is a subset of a normed linear space that admits unique best approximations. In the first part of this paper we present some ...
[45]
Pafnuty Chebyshev (1821 - 1894) - Biography - MacTutor
His work arose out of the theory of least squares approximation and probability; he applied his results to interpolation, approximate quadrature and other areas ...
[46]
[PDF] Chebyshev approximation
Chebyshev approximation is a part of approximation theory, which is a field of mathematics about approximating functions with simpler functions. This is done ...