Imagen de Portada

Two Online Map Matching Algorithms Based on Analytic Hierarchy Process and Fuzzy Logic

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lin, Jeremy J., Mochida, Tomoro, O'Neill, Riley C. W., Yoshida, Atsuro, Yamazaki, Masashi, Sasada, Akinobu
Formato:	Preprint
Publicado:	2024
Materias:	Computational Geometry Artificial Intelligence Computer Vision and Pattern Recognition
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Improving Fuzzy-Logic based Map-Matching Method with Trajectory Stay-Point Detection
por: Jafarlou, Minoo, et al.
Publicado: (2022)

Invariants of flat connections on 4-manifolds from Hopf group-algebras
por: Mochida, Tomoro
Publicado: (2024)

Geometric Bipartite Matching Based Exact Algorithms for Server Problems
por: Raghvendra, Sharath, et al.
Publicado: (2025)

Optimal Algorithm for the Planar Two-Center Problem
por: Cho, Kyungjin, et al.
Publicado: (2020)

Revisiting Map Relations for Unsupervised Non-Rigid Shape Matching
por: Cao, Dongliang, et al.
Publicado: (2023)

New Lower Bound and Algorithms for Online Geometric Hitting Set Problem
por: De, Minati, et al.
Publicado: (2024)

Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane
por: Lynch, Jayson, et al.
Publicado: (2025)

Singular Arrange and Traverse Algorithm for Computing Reeb Spaces of Bivariate PL Maps
por: Hristov, Petar, et al.
Publicado: (2026)

Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation
por: Abrahamsen, Mikkel, et al.
Publicado: (2025)

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
por: Chung, Chaeyoon, et al.
Publicado: (2026)

A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation
por: Chan, Timothy M., et al.
Publicado: (2025)

Cyclotomic generating functions, empty weighted complete intersections and positivity
por: Gatzweiler, Mona, et al.
Publicado: (2026)

Online Algorithms for Geometric Independent Set
por: De, Minati, et al.
Publicado: (2026)

Continuous Map Matching to Paths under Travel Time Constraints
por: Bosch, Yannick, et al.
Publicado: (2025)

Boosting Rectilinear Steiner Minimum Tree Algorithms with Augmented Bounding Volume Hierarchy
por: Yang, Puhan, et al.
Publicado: (2025)

Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
por: Bhore, Sujoy, et al.
Publicado: (2023)

Geometric Bipartite Matching is in NC
por: Bhore, Sujoy, et al.
Publicado: (2024)

MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem
por: Zhou, Yi, et al.
Publicado: (2026)

Connected Matchings
por: Aichholzer, Oswin, et al.
Publicado: (2024)

The Euclidean $k$-Matching Problem is NP-hard
por: Díaz-Báñez, José-Miguel, et al.
Publicado: (2025)

Fully Dynamic Geometric Vertex Cover and Matching
por: Bhore, Sujoy, et al.
Publicado: (2024)

Matching random colored points with rectangles (Corrigendum)
por: Corujo, Josué, et al.
Publicado: (2025)

Flips in Odd Matchings
por: Aichholzer, Oswin, et al.
Publicado: (2024)

On Support Relations Inference and Scene Hierarchy Graph Construction from Point Cloud in Clustered Environments
por: Ma, Gang, et al.
Publicado: (2024)

Online Class Cover Problem
por: De, Minati, et al.
Publicado: (2023)

Online Packing of Orthogonal Polygons
por: Gerlach, Tim, et al.
Publicado: (2026)

Online Geometric Covering and Piercing
por: De, Minati, et al.
Publicado: (2023)

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
por: Park, Seongbin, et al.
Publicado: (2026)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
por: Bhore, Sujoy, et al.
Publicado: (2026)

Efficient Many-To-Many Matching of Points with Demands in One Dimension
por: Rajabi-Alni, Fatemeh, et al.
Publicado: (2019)

Two Tiling is Undecidable
por: Stade, Jack
Publicado: (2025)

Hierarchical Rectangle Packing Solved by Multi-Level Recursive Logic-based Benders Decomposition
por: Grus, Josef, et al.
Publicado: (2025)

Visual Complexity of Point Set Mappings
por: Meulemans, Wouter, et al.
Publicado: (2024)

Online Hitting Set for Axis-Aligned Squares
por: De, Minati, et al.
Publicado: (2025)

Online Hitting Sets for Disks of Bounded Radii
por: De, Minati, et al.
Publicado: (2024)

Algorithms for orthogonal partitioning into four parts
por: Fakhrutdinov, Alexey, et al.
Publicado: (2025)

How Hard is it to be a Star? Convex Geometry and the Real Hierarchy
por: Schaefer, Marcus, et al.
Publicado: (2025)

Summarizing Classed Region Maps with a Disk Choreme
por: Broek, Steven van den, et al.
Publicado: (2025)

Analytic Conditions for Differentiable Collision Detection in Trajectory Optimization
por: Jaitly, Akshay, et al.
Publicado: (2025)

Approximation Algorithms for Anchored Multiwatchman Routes
por: Mitchell, Joseph S. B., et al.
Publicado: (2024)