Jin, 2021 - Google Patents
Multi-objective A* algorithm for the multimodal multi-objective path planning optimizationJin, 2021
- Document ID
- 7601360986815276729
- Author
- Jin B
- Publication year
- Publication venue
- 2021 IEEE Congress on Evolutionary Computation (CEC)
External Links
Snippet
In this paper, we consider the multimodal multi-objective path planning (MMOPP) optimization, which is the main topic of a special session in IEEE CEC 2021. The MMOPP aims at finding all the Pareto optimal paths from a start area to a goal area on a grid map …
- 238000005457 optimization 0 title abstract description 16
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N7/00—Computer systems based on specific mathematical models
- G06N7/005—Probabilistic networks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
- G06N5/02—Knowledge representation
- G06N5/022—Knowledge engineering, knowledge acquisition
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
- G06Q10/063—Operations research or analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
- G06N5/04—Inference methods or devices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
- G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
- G06F17/30961—Trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/12—Computer systems based on biological models using genetic models
- G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jin | Multi-objective A* algorithm for the multimodal multi-objective path planning optimization | |
| Lei et al. | Boosting logical reasoning in large language models through a new framework: The graph of thought | |
| US20100161532A1 (en) | Determination of graph connectivity metrics using bit-vectors | |
| Hou et al. | The Prediction of Multistep Traffic Flow Based on AST‐GCN‐LSTM | |
| Sæther et al. | Solving# SAT and MAXSAT by dynamic programming | |
| Violina | Analysis of brute force and branch & bound algorithms to solve the traveling salesperson problem (TSP) | |
| Gu et al. | A random-key genetic algorithm-based method for transportation network vulnerability envelope analysis under simultaneous multi-link disruptions | |
| Kwisthout et al. | The computational complexity of sensitivity analysis and parameter tuning | |
| Şuvak et al. | Minimum cost flow problem with conflicts | |
| Todkar et al. | Aspiration level-based non-dominated sorting genetic algorithm II & III to solve fuzzy multi-objective shortest path problem | |
| Wang et al. | Provable guarantees on the robustness of decision rules to causal interventions | |
| EP3493063A1 (en) | A monitoring system and method | |
| El-Gharably et al. | Optimization using simulation of the vehicle routing problem | |
| Wang et al. | On searching multiple disjoint shortest paths in scale-free networks with hyperbolic geometry | |
| Chatterjee et al. | An improved algorithm for k-terminal probabilistic network reliability analysis | |
| Todkar et al. | Enhanced non-dominated sorting genetic algorithms for uncertain multi-objective shortest path problem: application to fire prevention services | |
| Denysiuk et al. | A new hybrid evolutionary multiobjective algorithm guided by descent directions | |
| Liu | Multi-objective optimization on dynamic complex networks | |
| Nguyen | Overview of Bayesian Network | |
| Rahwan et al. | An exact algorithm for coalition structure generation and complete set partitioning | |
| He et al. | Measuring component importance for network system using cellular automata | |
| Arulkumar et al. | Exploring Social Networking Data Sets | |
| Angel et al. | Evolution of recursive trees with limited memory | |
| Nannapaneni et al. | Automated uncertainty quantification analysis using a system model and data | |
| Liu | A Simulation-Infused Optimization Approach for Decomposing Nonlinear Systems |