Keywords

1 Introduction

To obtain an efficacious path planning, researchers put the deep attention on navigational strategies. Path planning is defined as obtaining an optimal path to guide the WR from the start point to the target by avoiding collision with the obstacles. Path planning becomes a broad topic for researchers. Figure 1 describes the wheeled robot embedded with an efficient and robust technique gives us optimum, shortest, and collision-free path planning. Algabri et al. [1] have used particle swarm optimization (PSO) to optimize the fuzzy logic controller by adjusting the membership function automatically. Real Khepera III platform was the main focus, and the proposed technique was compared with it. Liu et al. [2] outlined the genetic fuzzy controller. Authors implemented a genetic algorithm so that enhanced parameters of membership function and scaling factor can be obtained. The neuro-fuzzy technique has been proposed in [3] for the path planning of autonomous mobile robot (AMR). Weighing factor is determined to minimize the count of fuzzy rules. Korkmaz and Durdu [4] have concluded that A* and PRM technique is efficient in terms of travel length and elapsed time, respectively. Lu and Gong [5] experimented in an unknown environment with AMR embedded with PSO. They implemented PSO to obtain the best path, but it lacks in modifying the control parameters. Li and Chen [6] have carefully used a five-order polynomial to design smooth trajectory based on PSO and adaptive neural network control. Parhi et al. [7] have simulated and experimented the theory to find the behavior of swarm intelligence techniques. Using the proposed technique, authors try to obtain the optimized path for autonomous wheeled robot.

Fig. 1
figure 1

Result of best technique on implementation in the wheeled robot

2 Kinematics of Wheeled Robot

Kinematics defines the geometry of motion. It describes the initial conditions and portrays the positions of the WR. Steering of the WR is retrieved by utilizing various conditions, which are listed below in equations. Different property of wheels should be attained; these are (1) non-deformable, (2) pure rolling (v = 0 at contact points), and (3) no slip, skid, or slide. a is the radius of wheels; x is the distance between powered wheels. R is the point which is used to estimate the position and motion of the WR. It is pointed at the intersection of the axis of the powered wheel and a straight line passing through the center of mass of the system. Figure 2 describes the schematic diagram of the WR in (X0, Y0) plane. (XN, YN, α) is the location and the orientation of the WR. The axes (X0, Y0) indicate inertial global reference frame with origin O. α is the angular difference between the global and reference frames. The global reference frame is denoted by point R on the robot chassis specified by coordinates (X, Y). Center of mass is represented by C.

Fig. 2
figure 2

Schematic diagram of wheeled robot in X0Y0 plane

Description of kinematic model is shown by following equations:

$$\dot{x} = \left( {W_{\text{l}} + W_{\text{r}} } \right)\cos \alpha /2$$
(1)
$$\dot{y} = \left( {W_{\text{l}} + W_{\text{r}} } \right)\sin \alpha /2$$
(2)
$$\dot{\alpha } = \left( {W_{\text{l}} - W_{\text{r}} } \right)/b$$
(3)

where \(W_{\text{l}}\) = velocity of the left wheel, \(W_{\text{r}}\) = velocity of the right wheel, and \(b\) = track width between two wheels.

Following conditions are used for the orientation of the WR:

  1. 1.

    \(W_{\text{l}}\) = \(W_{\text{r}}\), Robot travel straight.

  2. 2.

    \(W_{\text{l}}\) < \(W_{\text{r}}\), Robot turns left.

  3. 3.

    \(W_{\text{l}}\) > \(W_{\text{r}}\), Robot turns right.

3 Navigational Algorithm

Teaching–learning-based optimization technique is the centerpiece of this research paper. It is applied to optimize the path planning for an autonomous, obtain a shortest and collision-free path. TLBO is a nature-based technique that depends upon the teaching and learning skill of teacher and learner, respectively. The ability of the teacher to teach decides the strength of optimized result because at last teacher (best learner) is described as the best solution. TLBO optimizes the problem for two times in a single run, one after teacher phase and second after the learner phase. This process optimizes the path planning of the robot better than other optimization technique [9] and provides the shortest and collision-free path.

Rao et al. [8] have proposed TLBO, and in this paper, it is inserted in path planning. Researchers observed the behavior of learning the skill of learner from teachers and other learner and proposed this technique. Implemented technique mainly contains two phases: One is teacher phase described in Fig. 3a, and second is the learner phase described in Fig. 3b. Teacher phase represents the first optimization of skill of leaner, in which learner observed and grabs the knowledge of the teacher. In the second phase, i.e., learner phase, learners interact among themselves and further optimize their skills. Figure 4 shows the steps for obtaining the optimized path.

Fig. 3
figure 3

Representation of different phases

Fig. 4
figure 4

Steps to obtain an optimized path

Fitness function of TLBO:

Optimization of any technique very much depends upon its selected fitness function. Therefore, the fitness function of any technique should be decided precisely. TLBO mainly revolves around the ability to gain knowledge by the learner, and it decreases the path length by optimizing the turning angle of the WR. Therefore, two fitness functions which are picked for TLBO technique are:

  1. (1)

    The distance between wheeled robot, start point, target, and obstacles:

The command given to the WR is to move in Euclidean distance. TLBO embedded WR always follows the same path to reach the target until any obstacles come in between its path. When such things occur, the WR takes a turn with the sufficient and optimum angle and again follows the same shortest path.

$$f_{1} = \sqrt {\left( {{\text{Tarm}} - m\left( i \right)} \right)^{2} + \left( {{\text{Tarn}} - n\left( i \right)} \right)^{2} }$$
(4)

where \(f_{1}\) is the first fitness function of the proposed technique. Coordinate of the start point in ith iteration is \(\left( {m\left( i \right), n\left( i \right)} \right)\), and coordinate of the target is given by \(\left( {{\text{Tarm,}} \,{\text{Tarn}}} \right)\).

  1. (2)

    Turning angle while avoiding obstacles:

Turning angle should not be too less that; it fails to avoid the collision. In addition, it should not be too large that it increases the path length. It should be selected after many iterations so that it satisfies the need of the problem. Optimality of the solution depends upon the optimality of the turning angle, and it is represented as follow:

$$f_{2} = \left\{ {\begin{array}{*{20}l} {{\text{optimum}}\left( i \right),} \hfill & {x < {\text{safe}}\,\,{\text{distance}}} \hfill \\ {\tan^{ - 1} \frac{y\left( i \right)}{x\left( i \right)},} \hfill & {x \ge {\text{safe}}\,\,{\text{distance}}} \hfill \\ \end{array} } \right.$$
(5)

where \(f_{2}\) is the second fitness function of the proposed technique. \({\text{optimum}}\left( i \right)\) is the best turning angle when the WR comes in front of obstacles. \(\left( {x\left( i \right), y\left( i \right)} \right)\) is the coordinate of the WR at ith iteration.

4 Simulation Results

MATLAB graphical user interphase (GUI) has been taken into consideration to obtain the simulation results. Three different types of environments have been considered to find out the stableness of the proposed technique. Environments have one obstacle, two obstacles, and multi-obstacles which have been preferred as shown in Figs. 5, 6, and 7. The complexity of the environment is gradually increased to retrieve the strength of TLBO technique. In each environment, WR embedded with TLBO technique is reaching the target by avoiding the obstacles. In every environment, sufficient numbers of iterations are carried out, and it is about 10–30, and sometimes it reaches up to 40, depending upon the complexity of the environments. A sufficient number of iterations results in optimum path selection by avoiding the collision with the obstacles. Figure 5 makes evident that WR reached the target by avoiding the single pentagon-shaped obstacle. In the process, 12 iterations were carried out to obtain the optimized result. Sometimes the WR reached the target without avoiding collision with the obstacle, reached the target, avoided the obstacle, but the travel length is high. Finally, after 12 iterations, following result has been obtained which is optimum. In Fig. 6, WR is simulated in the environment having two obstacles, one having pentagon shape and other triangular shape. The complexity of this environment is in more than the previous environment because of the shape and number of obstacles. As the complexity is increased, subsequently the number of iterations to obtain the optimum result has been increased. 23 iterations were carried out, and different problems arise in each run. Different results have been gathered, and the optimum result is selected as shown in Fig. 6. Now, the complexity of the environment is tossed to the top, so that the stability, effectuality, robustness, and efficiency of the technique can be gathered. Multiple obstacles having different shape increased the difficulty to the peak. After 28 iterations, we picked the best result which is completing all the need of the WR as shown in Fig. 7. So finally, it can be understood from the results (Figs. 5, 6, and 7) the selected technique is robust and efficient enough to successfully work in any environment.

Fig. 5
figure 5

Application of TLBO technique in environment having one obstacle

Fig. 6
figure 6

Application of TLBO technique in environment having two obstacles

Fig. 7
figure 7

Application of TLBO technique in environment having many obstacles

5 Comparison with Previously Opted Technique

Performing simulation experiment of any technique in the various environment is not enough to claim that it is best. It should give some evident that it is better by comparing it with previously implemented techniques. The current technique is compared with previously opted technique to find out the response in the environment selected by them. To get the best possible result, the previously designed environment is replicated. In addition, during replication, it is strictly taken care to obtain the best possible result. Deepak and Parhi [9] observed the result as shown in Fig. 8a after implementing PSO technique. Figure 8b is describing the best result which is obtained by embedding the TLBO technique. It took more number of iteration to improve the result. At last, the result we obtained is far better than the previously used technique. Table 1 is sufficient to find out the best technique. Travel length in the current technique is lesser than the travel length obtained in previously opted technique. It is effortlessly winning the race of obtaining the shortest travel length.

Fig. 8
figure 8

a Route selected by PSO technique [9]. b Route selected by currently proposed TLBO technique

Table 1 Results gathered from Fig. 8a and b

6 Conclusion

The current paper is making evident of the shortest path length after selecting TLBO technique. The current technique is demonstrated in the various environment by gradually increasing the difficulty. Every time the current technique comes out as the winner with the optimum and best possible result. The technique is extremely robust and efficient that irrespective of the complexity of the environment, it provides the best possible results. The current technique is compared with the previously opted technique, and the result is favorable. TLBO reached the target by traveling the shortest path. Finally, it can be accepted the TLBO technique can work in any environment and give the optimized result. It is also better than the previously opted technique in their selected environment. Future studies could investigate the mutation of TLBO with different algorithms to obtain more efficient results.