Time complexity of two disjoint simple paths

Razzazi, Mohammadreza; Sepahvand, Abdolah

doi:10.24200/sci.2017.4116

Cited by 5 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kaneko [6] generalized this theorem to general graphs. For other results on graph factors, see [7][8][9][10][11][12][13][14][15][16][17][18][19][20][21].…”

Section: Introductionmentioning

confidence: 99%

Two sufficient conditions for the existence of path factors in graphs

Zhou

Yang

2018

Scientia Iranica

View full text Add to dashboard Cite

show abstract

“…Kaneko [6] generalized this theorem to general graphs. For other results on graph factors, see [7][8][9][10][11][12][13][14][15][16][17][18][19][20][21].…”

Section: Introductionmentioning

confidence: 99%

Two sufficient conditions for the existence of path factors in graphs

Zhou

Yang

2018

Scientia Iranica

View full text Add to dashboard Cite

show abstract

“…Deepak et al– tried to add some modifications to stand‐alone artificial intelligent techniques for performance improvement and compared the results of hybridisation with stand‐alone methods. Razzazi et al proposed an idea regarding time complexity of two disjoint simple paths. Their study is primarily applicable to path planning of mobile robots.…”

Section: Introductionmentioning

confidence: 99%

Navigation of multiple humanoid robots using hybrid adaptive swarm‐adaptive ant colony optimisation technique

Parhi

Sahu

Kumar

2018

Computer Animation & Virtual

View full text Add to dashboard Cite

This paper is aimed at designing a navigation strategy for humanoid robots using a hybridised technique consisting of adaptive particle swarm optimisation and adaptive ant colony optimisation. The inputs to the navigational controller are the front obstacle distance, left obstacle distance, and right obstacle distance, and the output is the required final turning angle to reach the target position. Here, the governing parameters of the adaptive ant colony optimisation technique are optimised by using adaptive particle swarm optimisation method. These optimised parameters are subsequently used by the adaptive ant colony optimisation technique to get the final turning angle by which the humanoid navigates in a cluttered environment. Here, navigation is performed in both static and dynamic environments. To avoid the intercollision among the humanoids, a Petri‐net controller has been designed and implemented along with the proposed hybridised method. Humanoid navigation is performed in both simulated and experimental environments, and a comparison is done between them. Finally, the proposed controller is compared with the developed method by other researchers.

show abstract

“…Singh et al [17][18][19] discussed the use of computational intelligence for smooth and collisionfree path generation for wheeled mobile robots. Razzazi and Sepahvand [20] proposed an idea regarding time complexity of two disjoint simple paths. Their study is primarily applicable to path planning of mobile robots.…”

Section: Introductionmentioning

confidence: 99%

Static and Dynamic Path Planning of Humanoids using an Advanced Regression Controller

et al. 2018

View full text Add to dashboard Cite

KEYWORDSAbstract. With the ability to mimic human behaviour, humanoid robots have become a topic of major interest among research fellows dealing with robotic investigation. The current work is focused on the design of a novel navigation controller based on the logic of the regression analysis to be used in the path planning and navigation of humanoid robots. The current investigation focuses on static and dynamic path planning of humanoid NAOs. The static path planning represents a single NAO navigating through random static obstacles. The dynamic path planning represents multiple humanoid NAOs navigating through random static obstacles and acting as dynamic obstacles for each other. A Petri-net controller is designed to avoid the collision among multiple NAOs in dynamic path planning. To reduce path length and time travel and provide the shortest possible path, an advanced regression controller is implemented in the NAOs in both simulation and experimental environments. Finally, a comparison has been performed between the simulation and experimental results, and good agreement is observed between both of the results with a minimal percentage of error. The proposed navigation controller is also tested against other existing navigational technologies to validate better e ciency.

show abstract

Time complexity of two disjoint simple paths

Cited by 5 publications

References 10 publications

Two sufficient conditions for the existence of path factors in graphs

Two sufficient conditions for the existence of path factors in graphs

Navigation of multiple humanoid robots using hybrid adaptive swarm‐adaptive ant colony optimisation technique

Static and Dynamic Path Planning of Humanoids using an Advanced Regression Controller

Contact Info

Product

Resources

About