This paper presents the solution to inverse kinematics of a mobile manipulator operating in
both obstacle free environment and cluttered workspace. This work conceives an …

Many interesting search problems can be formulated as bi-objective search problems, that
is, search problems where two kinds of costs have to be minimized, for example, travel …

The Fifteen Puzzle problem is one of the most classical problems that has captivated
mathematics enthusiasts for centuries. This is mainly because of the huge size of the state …

Abstract The Manta Ray Foraging Optimization Algorithm (MRFO) is a metaheuristic
algorithm for solving real-world problems. However, MRFO suffers from slow convergence …

Bayesian networks have many applications. Learning the optimal structure of a Bayesian
network has always been important in this respect. In this paper, a bidirectional heuristic …

NBS is a non-parametric bidirectional search algorithm proven to expand at most twice the
number of node expansions required to verify the optimality of a solution. We introduce new …

This paper focuses on the mobile robot path planning problem of optimizing the
performance metrics of bidirectional A* algorithm in randomized two-dimensional map …

Online social networks greatly promote peoples' online interaction, where trust plays a
crucial role. Trust prediction with trust path search is widely used to help users find the …

Recently there has been renewed interest in bidirectional heuristic search. New algorithms,
eg, MM, MMe, and NBS, have been introduced which seem much closer to refuting the …

In the past few years, new very successful bidirectional heuristic search algorithms have
been proposed. Their key novelty is a lower bound on the cost of a solution that includes …