Search

The aquaculture industry has rapidly grown over the year. One pertinent aspect is the ability of the aquaculture farm management to accurately count the fish populations to provide effective feeding and the control of breeding density. The current practice of counting the fish manually increased the hatchery workers workload and led to inefficiency. The presented work proposed an intelligent, web-based fish counting system to assist hatchery workers in counting fish from images. The methodology consists of two phases. First, an intelligent fish counting engine is developed. The captured image was first enhanced using the contrast limited adaptive histogram equalization. A deep learning architecture in the form of you only look once (YOLO)v5 is used to generate a model to identify and count fish on the image. Second, a web-based application is developed to implement the developed fish counting engine. When applied to the test data, the developed engine recorded a precision of 98.7% and a recall of 65.5%. The system is also evaluated by hatchery workers in the University Malaysia Sabah fish hatchery. The results of the usability and functionality evaluations indicate that the system is acceptable, with some future work suggested based on the feedback received. [ABSTRACT FROM AUTHOR]

To address an autonomous guided vehicle problem, this article presents extended variants of the established block over-relaxation method known as the Block Modified Two-Parameter Over-relaxation (B-MTOR) method. The main challenge in handling autonomous-driven vehicles is to offer an efficient and reliable path-planning algorithm equipped with collision-free feature. This work intends to solve the path navigation with obstacle avoidance problem explicitly by using a numerical approach, where the mobile robot must project a route to outperform the efficiency of its travel from any initial position to the target location in the designated area. The solution builds on the potential field technique that uses Laplace's equation to restrict the formation of potential functions across operating mobile robot regions. The existing block over-relaxation method and its variants evaluate the computation by obtaining four Laplacian potentials per computation in groups. These groups can also be viewed as groups of two points and single points if they're close to the boundary. The proposed B-MTOR technique employs red-black ordering with four different weighted parameters. By carefully choosing the optimal parameter values, the suggested B-MTOR improved the computational execution of the algorithm. In red-black ordering, the computational molecules of red and black nodes are symmetrical. When the computation of red nodes is performed, the updated values of their four neighbouring black nodes are applied, and conversely. The performance of the newly proposed B-MTOR method is compared against the existing methods in terms of computational complexity and execution time. The simulation findings reveal that the red-black variants are superior to their corresponding regular variants, with the B-MTOR approach giving the best performance. The experiment also shows that, by applying a finite difference method, the mobile robot is capable of producing a collision-free path from any start to a given target point. In addition, the findings also verified that numerical techniques could provide an accelerated solution and have generated a smoother path than earlier work on the same issue. [ABSTRACT FROM AUTHOR]

Mobile robots are always in a state where they have to find a collision-free path in their environment from start to the target point. This study tries to solve the problem of mobile robot iteratively by using a numerical technique. It is based on potential field technique that was modelled using the Laplace’s equation to restrain the creation of a potential functions across regions in the mobile robot’s configuration space. The gradient formed by the potential field is then used to generate a path for the robot to advance through. The present paper proposes a Two-Parameter Over-Relaxation (TOR) iterative method that is used to solve Laplace’s equation for obtaining the potential field that is then utilized for finding path of the robot, thus solving the robot pathfinding problem. The experiment indicates that it is capable of producing a smooth path between the starting and target points through the use of a finite-difference technique. Furthermore, the simulation results show that this numerical approach executes quicker and provides a smoother trail than to the previous works, that includes Successive Over-Relaxation (SOR) and Accelerated Over-Relaxation (AOR) methods.

Currently, designing path-planning concepts for autonomous robot systems remains a topic of high interest. This work applies computational analysis through a numerical approach to deal with the path-planning problem with obstacle avoidance over a robot simulation. Based on the potential field produced by Laplace's equation, the formation of a potential function throughout the simulation configuration regions is obtained. This potential field is typically employed as a guide in the global approach of robot path-planning. An extended variant of the over-relaxation technique, namely the skewed block two-parameter over relaxation (SBTOR), otherwise known as the explicit decoupled group two-parameter over relaxation method, is presented to obtain the potential field that will be used for solving the path-planning problem. Experimental results with a robot simulator are presented to demonstrate the performance of the proposed approach on computing the harmonic potential for solving the path-planning problem. In addition to successfully validating pathways generated from various locations, it is also demonstrated that SBTOR outperforms existing over-relaxation algorithms in terms of the number of iterations, as well as the execution time. [ABSTRACT FROM AUTHOR]