Test Whats new message.
Scheduled Maintenance on Monday 1/13/2025
Single article sales and account management will be unavailable from 5:00 AM - 7:00 PM ET (09:00 - 23:00 UTC). We apologize for the inconvenience.
Showing 1-25 of 9,154 resultsfor "Index Terms":Execution Path
"Index Terms":Execution Path
- Sort
Get notified when new research is published matching your search criteria.
Sort By
Results
A Web Service Composition Method Based on Multi-path
2009 IITA International Conference on Services Science, Management and Engineering
Year: 2009 | Conference Paper |
Cited by: Papers (1)
While a single Web service canpsilat satisfy complex business needs, how to compose a large granularity Web service by small ones is an important issue at present. However, the research of service composition focuses the selection of concrete service on the basis of abstract service, and neglects abstract service modeling. This paper defines composition service problem as a graph, transforms servi...Show More
Enforcing Data-Aware Business Processes Using Execution Path-Oriented Strategies
Qi Mo;Jianeng Wang;Yi Jiang;Zhongwen Xie;Wei Wang;Cong Liu;Fei Dai
Since the data-aware business process usually covers the control flow and data flow, and both of them have a direct impact on its execution, it is challenging to ensure its correctness. In this article, we propose a novel correctness enforcement approach for the data-aware business the processes. Given a data-aware business process, this approach first relies on the notion of the execution paths t...Show More
Multi Objective Path Planning in Static Environment using Region of Sight
2020 International Youth Conference on Radio Electronics, Electrical and Power Engineering (REEPE)
Year: 2020 | Conference Paper |
Cited by: Papers (1)
Finding appropriate path, that avoids the hurdles and reach the goal in optimal way, has been an interesting challenge in recent years. In this paper, we present a new method for robot path planning in a static environment. The main aim; to tackle path planning in simple and fast method, seeks to satisfy many robot movement's requirements such as shortest path length, safety, smoothness with less ...Show More
Challenges in Applying Multi-Agent Path Finding Solutions to Real-World Applications
2024 24th International Conference on Control, Automation and Systems (ICCAS)
Year: 2024 | Conference Paper |
Multi-Agent Path Finding (MAPF) is a problem that involves planning collision-free paths from start to goal locations for individual agents. Numerous studies have been conducted to solve MAPF. However, there are many challenges that should be addressed to apply the planned paths in real-world applications. This paper explores these issues, focusing on path planning and execution for multi-robot op...Show More
Robot Path Integration in Manufacturing Processes: Genetic Algorithm Versus Ant Colony Optimization
Tool path planning for automated manufacturing processes is a computationally complex task. This paper addresses the problem of tool path integration in the context of spray-forming processes. Tool paths for geometry-complicated parts are generated by partitioning them into individual freeform surfaces, generating the paths for each partition, and then, finally, interconnecting the paths from the ...Show More
Dijkstra's shortest path algorithm serial and parallel execution performance analysis
Nadira Jasika;Naida Alispahic;Arslanagic Elma;Kurtovic Ilvana;Lagumdzija Elma;Novica Nosovic
2012 Proceedings of the 35th International Convention MIPRO
Year: 2012 | Conference Paper |
This article introduces the problem of parallelization of Dijkstra's algorithm, a well known algorithm for computing single-source shortest path in a graph. Dijkstra's algorithm can be applied to graphs with a various number of vertices and edges. Dijkstra's shortest path algorithm is implemented and presented, and the performances of its parallel and serial execution are compared. The algorithm i...Show More
Performance Analysis of Floyd-Warshall Algorithm: Sequential and Parallel Execution Using Intel oneAPI
2024 8th International Conference on Electronics, Communication and Aerospace Technology (ICECA)
Year: 2024 | Conference Paper |
The Floyd-Warshall algorithm is a widely utilized graph-based technique designed to address the all-pairs shortest path problem. However, its cubic time complexity $O\left(n^{3}\right)$ creates performance bottlenecks when applied to large graphs, especially in sequential execution. This paper explores the use of Intel oneAPI’s Data Parallel C++ (DPC++) programming model to optimize the performanc...Show More
To improve the efficiency of the traditional warehouse system, a multi-robot task allocation and path planning method for the warehouse system are designed according to the function of it. In the multi-robot task allocation, considering the impact of congestion on the task execution cost, the market auction algorithm which is improved makes the probability compensation of the task execution cost, ...Show More
Time Constraint Finite-Horizon Path Planning Solution for Micromouse Extreme Problem
2022 IEEE 19th International Conference on Mobile Ad Hoc and Smart Systems (MASS)
Year: 2022 | Conference Paper |
Cited by: Papers (1)
The original Micromouse competition was designed to educate future engineers, in robotic problem solving through active learning methods. The Micromouse Extreme (ME) Competition is proposed, to augment the pedagogical power of the original competition with a modern task set requiring skills in deep learning and creative solving methods. It also preserves the goal of original Micromouse Problem wil...Show More
Optimal Path Planning for Mobile Robots Using Memory Efficient A*
2016 International Conference on Frontiers of Information Technology (FIT)
Year: 2016 | Conference Paper |
Cited by: Papers (10)
Optimal path for robot in collision free space is influenced by a number of factors such as path length, total number of turns, and execution time. A* is a well-known grid based path planning approach used for path planning of robots. In this paper, an efficient variation of A*, named Memory Efficient A* (MEA*), is proposed to find optimal path between start and goal point while avoiding obstacles...Show More
Potential Neural Fields: A New Path Planning Approach for Swift and Smooth Paths
Raouf Fareh;Mohammed Baziyad;Maamar Bettayeb;Tamer Rabie;Ibrahim Kamel
2024 12th International Conference on Control, Mechatronics and Automation (ICCMA)
Year: 2024 | Conference Paper |
In recent years, there has been a notable shift in neural network methodologies with the emergence of "neural fields," fully connected networks capable of encoding continuous signals across arbitrary dimensions. This paper introduces a novel path planning approach by integrating neural fields into the encoding of potential fields for map representation. The method involves fitting a neural network...Show More
UAV Path Planning Based on the Combination of A-star Algorithm and RRT-star Algorithm
2022 IEEE International Conference on Unmanned Systems (ICUS)
Year: 2022 | Conference Paper |
Cited by: Papers (22)
In order for UAVs to perform tasks safely and efficiently, path planning for UAVs is required. The A-star algorithm can calculate the optimal path, but it needs to rasterize the map in advance and run for a long time. When the map changes, the A-star algorithm cannot quickly obtain a new path. This work proposes a UAV path planning system using the combination of the A-star algorithm and the RRT-s...Show More
Multi-obstacle Path Planning of UAV Based on Improved Ant Colony System Algorithm
2020 IEEE 5th Information Technology and Mechatronics Engineering Conference (ITOEC)
Year: 2020 | Conference Paper |
Cited by: Papers (2)
Recently unmanned aerial vehicles (UAVs) have been widely adopted by military and civilian applications due to their strong autonomies and adaptabilities. Especially in some tasks, a complex path planning problem is that a UAV traverses and searches multiple targets in an environment with obstacles, which is a traveling salesman problem with NP-hard computational complexity. The traditional algori...Show More
UUV 3D Path Planning Based on PSO-ACO Fusion Algorithm
2022 37th Youth Academic Annual Conference of Chinese Association of Automation (YAC)
Year: 2022 | Conference Paper |
Cited by: Papers (1)
In order to solve the problems of difficult convergence and local optimal solution of ant colony optimization (ACO) algorithm, and low convergence accuracy of particle swarm optimization (PSO) algorithm, a particle swarm optimization ant colony optimization (PSO-ACO) fusion algorithm is proposed to deal with the three-dimensional (3D) path planning problem of unmanned underwater vehicle (UUV). In ...Show More
IACO-DQ Path Planning for AGV in Complex and Dynamic Environments
2024 6th International Conference on Robotics and Computer Vision (ICRCV)
Year: 2024 | Conference Paper |
This study addresses the problem of autonomous navigation and obstacle avoidance for mobile robots in complex and dynamically changing environments. A path planning strategy is proposed, namely the IACO-DQ (I-ACO and Dyna-Q) algorithm, which utilizes I-ACO (Improved Ant Colony Optimization) to construct an initial global optimal path framework. This is combined with the model learning and planning...Show More
Continuum Robot Path Planning Based on Improved Genetic Algorithm
2022 2nd International Conference on Algorithms, High Performance Computing and Artificial Intelligence (AHPCAI)
Year: 2022 | Conference Paper |
With the development of robotics industry, the robot path planning problem has become a very hot research direction. Among them, continuum robots, as a special kind of robots, have certain differences from ordinary robots in path planning, and it is helpful to develop special path planning strategies for continuum robots for their applications. Therefore, based on the improved genetic algorithm, t...Show More
A hybrid approach in TADE for derivation of execution time bounds of program-segments in distributed real-time embedded computing
Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)
Year: 2006 | Conference Paper |
Cited by: Papers (5)
Guaranteeing response times of real-time (RT) distributed computing systems has been recognized as one of the biggest challenges by the RT software research community for three decades. The concept of a hybrid approach that combines analytical derivation approaches and testing-based statistical derivation approaches in a symbiotic form for meeting this challenge was presented in recent years. Howe...Show More
Automated test generation on path-based symbolic execution
2014 IEEE 5th International Conference on Software Engineering and Service Science
Year: 2014 | Conference Paper |
Cited by: Papers (1)
This paper describes the path-based symbolic execution of programs in order to solve the “path-storm” problem in traditional symbolic execution. Instead of using execution tree, execution digraph is used, and the program execution is simplified by clustering the execution of loops, and decrease the paths generated from the execution of loops by classifying the constraints. The verification and ana...Show More
Research on Parallel Symbolic Execution through Program Dependence Analysis
2012 Fifth International Symposium on Computational Intelligence and Design
Year: 2012 | Conference Paper |
Cited by: Papers (1)
Through program dependence analysis, the method of parallel symbolic execution based on reduction about program execution path family was proposed. Firstly, instruction statements which affect on the symbolic value were extracted according to data dependency. then the key branch conditions controlling these statements were located and connected. Thus the reduction algorithm from multiple paths of ...Show More
A Location Based Execution Path Selection for Composite Service in MANETs
2008 The 9th International Conference for Young Computer Scientists
Year: 2008 | Conference Paper |
There has been great interest in service composition to exploit resources of distributed nodes in mobile ad hoc networks. During composite service execution, the execution path for composite service is very important because of its significant influence on network overhead and the percentage of failure. In this paper, we study the execution path selection problem, which focuses on selecting a shor...Show More
Formalizing Path Explosion for Recursive Functions via Asymptotic Path Complexity
Eli Pregerson;Shaheen Cullen-Baratloo;David Chen;Duy Lam;Max Szostak;Lucas Bang
2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE)
Year: 2023 | Conference Paper |
Cited by: Papers (1)
Path coverage is of critical importance in software testing and verification. Furthermore, path explosion is a well-known challenge for automatic software analysis techniques like symbolic execution. Asymptotic Path Complexity (APC) is a code complexity metric that formalizes the quantitative measurement of path explosion and therefore measures the difficulty of achieving path coverage. Prior APC ...Show More
Comparative Study of Path Prediction Method for Speculative Loop Execution
Kazuhiro Kinkai;Takanobu Baba;Hiroyoshi Jutori;Kanemitsu Ootsu;Takeshi Ohkawa;Takashi Yokota
2012 Third International Conference on Networking and Computing
Year: 2012 | Conference Paper |
Cited by: Papers (2)
Execution path ratio is mostly dominated by two execution paths in program loops. We have developed Two-Path Limited Speculation Method that achieves speed-up in programs using optimization of the most frequent two paths and speculative multi-thread execution of them. The path predictor used in the method predicts the next execution path in Two-Path Limited Speculation Method, and plays an importa...Show More
Path length comparison in grid maps of planning algorithms: HCTNav, A* and Dijkstra
Nafiseh Osati Eraghi;Femando López-Colino;Angel de Castro;Javier Garrido
An important aspect in path planning for mobile robots is to find the shortest path length from one point to another. In this paper, we implement HCTNav algorithm, A∗ and Dijkstra's algorithms on grid based maps and then compare their obtained path lengths. HCTNav algorithm is a path planning algorithm especially designed for low resources robots navigating in grid maps. Also Dijkstra's and A∗ alg...Show More
A Complete and Scalable Strategy for Coordinating Multiple Robots Within Roadmaps
IEEE Transactions on Robotics
Cited by: Papers (82)
This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popular algorithms for multirobot planning manage the complexity of the problem by planning trajectories for robots individually; such decoupled methods are not guaranteed to find a solution if one exists. In contrast, this paper descr...Show More
A parallel target-directed analysis method for malware behaviors
International Conference on Cyberspace Technology (CCT 2014)
Year: 2014 | Conference Paper |
To improve the efficiency of analyzing malware behaviors and increase the validity of the test data, this paper proposes a parallel target-directed analysis method for malware behaviors, which combines static analysis with concolic testing techniques. It first uses static analysis techniques to identify and locate those interactive or input points and sensitive behavior functions. Then based on th...Show More
IEEE Account
Purchase Details
Profile Information
Need Help?
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Contact Us
- Help
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Sitemap
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.