The efficiency of autonomous systems that tackle tasks such as home cleaning, agriculture harvesting, and mineral mining depends heavily on the adopted area coverage strategy. Extensive navigation strategies have been studied and developed, but few focus on scenarios with reconfigurable robot agents. This paper proposes a navigation strategy that accomplishes complete path planning for a Tetris-inspired hinge-based self-reconfigurable robot (hTetro), which consists of two main phases. In the first phase, polyomino form-based tilesets are generated to cover the predefined area based on the tiling theory, which generates a series of unsequenced waypoints that guarantee complete coverage of the entire workspace. Each waypoint specifies the position of the robot and the robot morphology on the map. In the second phase, an energy consumption evaluation model is constructed in order to determine a valid strategy to generate the sequence of the waypoints. The cost value between waypoints is formulated under the consideration of the hTetro robot platform’s kinematic design, where we calculate the minimum sum of displacement of the four blocks in the hTetro robot. With the cost function determined, the waypoint sequencing problem is then formulated as a travelling salesman problem (TSP). In this paper, a genetic algorithm (GA) is proposed as a strong candidate to solve the TSP. The GA produces a viable navigation sequence for the hTetro robot to follow and to accomplish complete coverage tasks. We performed an analysis across several complete coverage algorithms including zigzag, spiral, and greedy search to demonstrate that TSP with GA is a valid and considerably consistent waypoint sequencing strategy that can be implemented in real-world hTetro robot navigations. The scalability of the proposed framework allows the algorithm to produce reliable results while navigating within larger workspaces in the real world, and the flexibility of the framework ensures easy implementation of the algorithm on other polynomial-based shape shifting robots.

Applying the automation in covering the areas entirely eases manual jobs in various domestic fields such as site investigation, search, rescue, security, cleaning, and maintenance. A self-reconfigurable robot with adjustable dimensions is a viable answer to improve the coverage percentage for predefined map areas. However, the shape-shifting of this robot class also adds to the complexity of locomotion components and the need for an optimal complete coverage strategy for this new type of robot. The typical complete coverage route, including the least times of shape-shifting, the shortest navigation route, and the minimum travel time, is presented in the article. By splitting the map into the sub-areas similar to the self-reconfigurable robot's available shapes, the robot can design the ideal tileset and optimal navigation strategies to cover the workspace. To this end, we propose a Complete Tileset Energy-Aware Coverage Path Planning (CTPP) framework for a tiling self-reconfigurable robot named hRombo with four rhombus-shaped modules. The robot can reconfigure its base structure into seven distinct forms by activating the servo motors to drive the three robot hinges connecting robot modules. The problem of optimal path planning assisting the proposed hRombo robot to clear optimally all predefined tiles within the arbitrary workspace is considered a classic Travel Salesman Problem (TSP), and this TSP is solved by the reinforcement learning (RL) approach. The RL's reward function and action space are based on robot kinematic and the required energies, including transformation, translation, and orientation actions, to move the robot inside the workspace. The CTPP for the hRombo robot is validated with conventional complete coverage methods in simulation and real workspace conditions. The results showed that the CTPP is suitable for producing Pareto plans that enable robots to navigate from source to target in different workspaces with the least consumed energy and time among considered methods.

In this paper, a rigorous analysis of the performance of time-switching energy harvesting strategy that is applied for a half-duplex bidirectional wireless sensor network with intermediate relay over a Rician fading channel is presented to provide the exact-form expressions of the outage probability, achievable throughput and the symbol-error-rate (SER) of the system under the hardware impairment condition. Using the proposed probabilistic models for wireless channels between mobile nodes as well as for the hardware noises, we derive the outage probability of the system, and then the throughput and SER can be obtained as a result. Both exact analysis and asymptotic analysis at high signal-power-to-noise-ratio regime are provided. Monte Carlo simulation is also conducted to verify the analysis. This work confirms the effectiveness of energy harvesting applied in wireless sensor networks over a Rician fading channel, and can provide an insightful understanding about the effect of various parameters on the system performance.

In recent years, physical layer security has been considered as an effective method to enhance the information security beside the cryptographic techniques that are used in upper layers. In this paper, we provide the security analysis for a two-way relay network, where the two sources can only communicate through the intermediate relay nodes. In particular, we consider the scenario that there is an eavesdropper in the vicinity of one source node. Both reliability and security aspects are taken into consideration in our work. To enhance the reliability of communication, the intermediate relays are supplied with the energy harvested from the sources’ radio frequency (RF) signals using hybrid time-switching and power splitting (TPSR) protocol. Also, we apply the relay selection technique to select the best relay for the information exchange between two sources. Regarding security, the secrecy of information is improved with the help of friendly jammers nearby the eavesdropper. We provide the in-dept reliability and security analysis in terms of the closed-form expressions of the outage probability (OP) at the source nodes, the intercept probability (IP) at the eavesdropper, the secrecy outage probability (SOP), and the average secrecy capacity (ASC) of the system. Finally, the Monte Carlo simulations are also conducted to verify the correctness of our analysis and the effectiveness of the proposed scheme. Numerical results confirms that with the appropriate and feasible choices of involved parameters, both outage OP and IP can be kept at small values to guarantee the reliable and secure communication of the system.