Search results
1 – 10 of 78Yimei Chen, Yixin Wang, Baoquan Li and Tohru Kamiya
The purpose of this paper is to propose a new velocity prediction navigation algorithm to develop a conflict-free path for robots in dynamic crowded environments. The algorithm…
Abstract
Purpose
The purpose of this paper is to propose a new velocity prediction navigation algorithm to develop a conflict-free path for robots in dynamic crowded environments. The algorithm BP-prediction and reciprocal velocity obstacle (PRVO) combines the BP neural network for velocity PRVO to accomplish dynamic collision avoidance.
Design/methodology/approach
This presented method exhibits innovation by anticipating ahead velocities using BP neural networks to reconstruct the velocity obstacle region; determining the optimized velocity corresponding to the robot’s scalable radius range from the error generated by the non-holonomic robot tracking the desired trajectory; and considering acceleration constraints, determining the set of multi-step reachable velocities of non-holonomic robot in the space of velocity variations.
Findings
The method is validated using three commonly used metrics of collision rate, travel time and average distance in a comparison between simulation experiments including multiple differential drive robots and physical experiments using the Turtkebot3 robot. The experimental results show that our method outperforms other RVO extension methods on the three metrics.
Originality/value
In this paper, the authors propose navigation algorithms capable of adaptively selecting the optimal speed for a multi-robot system to avoid robot collisions during dynamic crowded interactions.
Details
Keywords
This paper aims to focus on solving the path optimization problem by modifying the probabilistic roadmap (PRM) technique as it suffers from the selection of the optimal number of…
Abstract
Purpose
This paper aims to focus on solving the path optimization problem by modifying the probabilistic roadmap (PRM) technique as it suffers from the selection of the optimal number of nodes and deploy in free space for reliable trajectory planning.
Design/methodology/approach
Traditional PRM is modified by developing a decision-making strategy for the selection of optimal nodes w.r.t. the complexity of the environment and deploying the optimal number of nodes outside the closed segment. Subsequently, the generated trajectory is made smoother by implementing the modified Bezier curve technique, which selects an optimal number of control points near the sharp turns for the reliable convergence of the trajectory that reduces the sum of the robot’s turning angles.
Findings
The proposed technique is compared with state-of-the-art techniques that show the reduction of computational load by 12.46%, the number of sharp turns by 100%, the number of collisions by 100% and increase the velocity parameter by 19.91%.
Originality/value
The proposed adaptive technique provides a better solution for autonomous navigation of unmanned ground vehicles, transportation, warehouse applications, etc.
Details
Keywords
Keyu Chen, Beiyu You, Yanbo Zhang and Zhengyi Chen
Prefabricated building has been widely applied in the construction industry all over the world, which can significantly reduce labor consumption and improve construction…
Abstract
Purpose
Prefabricated building has been widely applied in the construction industry all over the world, which can significantly reduce labor consumption and improve construction efficiency compared with conventional approaches. During the construction of prefabricated buildings, the overall efficiency largely depends on the lifting sequence and path of each prefabricated component. To improve the efficiency and safety of the lifting process, this study proposes a framework for automatically optimizing the lifting path of prefabricated building components using building information modeling (BIM), improved 3D-A* and a physic-informed genetic algorithm (GA).
Design/methodology/approach
Firstly, the industry foundation class (IFC) schema for prefabricated buildings is established to enrich the semantic information of BIM. After extracting corresponding component attributes from BIM, the models of typical prefabricated components and their slings are simplified. Further, the slings and elements’ rotations are considered to build a safety bounding box. Secondly, an efficient 3D-A* is proposed for element path planning by integrating both safety factors and variable step size. Finally, an efficient GA is designed to obtain the optimal lifting sequence that satisfies physical constraints.
Findings
The proposed optimization framework is validated in a physics engine with a pilot project, which enables better understanding. The results show that the framework can intuitively and automatically generate the optimal lifting path for each type of prefabricated building component. Compared with traditional algorithms, the improved path planning algorithm significantly reduces the number of nodes computed by 91.48%, resulting in a notable decrease in search time by 75.68%.
Originality/value
In this study, a prefabricated component path planning framework based on the improved A* algorithm and GA is proposed for the first time. In addition, this study proposes a safety-bounding box that considers the effects of torsion and slinging of components during lifting. The semantic information of IFC for component lifting is enriched by taking into account lifting data such as binding positions, lifting methods, lifting angles and lifting offsets.
Details
Keywords
Yahao Wang, Zhen Li, Yanghong Li and Erbao Dong
In response to the challenge of reduced efficiency or failure of robot motion planning algorithms when faced with end-effector constraints, this study aims to propose a new…
Abstract
Purpose
In response to the challenge of reduced efficiency or failure of robot motion planning algorithms when faced with end-effector constraints, this study aims to propose a new constraint method to improve the performance of the sampling-based planner.
Design/methodology/approach
In this work, a constraint method (TC method) based on the idea of cross-sampling is proposed. This method uses the tangent space in the workspace to approximate the constrained manifold pattern and projects the entire sampling process into the workspace for constraint correction. This method avoids the need for extensive computational work involving multiple iterations of the Jacobi inverse matrix in the configuration space and retains the sampling properties of the sampling-based algorithm.
Findings
Simulation results demonstrate that the performance of the planner when using the TC method under the end-effector constraint surpasses that of other methods. Physical experiments further confirm that the TC-Planner does not cause excessive constraint errors that might lead to task failure. Moreover, field tests conducted on robots underscore the effectiveness of the TC-Planner, and its excellent performance, thereby advancing the autonomy of robots in power-line connection tasks.
Originality/value
This paper proposes a new constraint method combined with the rapid-exploring random trees algorithm to generate collision-free trajectories that satisfy the constraints for a high-dimensional robotic system under end-effector constraints. In a series of simulation and experimental tests, the planner using the TC method under end-effector constraints efficiently performs. Tests on a power distribution live-line operation robot also show that the TC method can greatly aid the robot in completing operation tasks with end-effector constraints. This helps robots to perform tasks with complex end-effector constraints such as grinding and welding more efficiently and autonomously.
Details
Keywords
This study aims to solve the problem of job scheduling and multi automated guided vehicle (AGV) cooperation in intelligent manufacturing workshops.
Abstract
Purpose
This study aims to solve the problem of job scheduling and multi automated guided vehicle (AGV) cooperation in intelligent manufacturing workshops.
Design/methodology/approach
In this study, an algorithm for job scheduling and cooperative work of multiple AGVs is designed. In the first part, with the goal of minimizing the total processing time and the total power consumption, the niche multi-objective evolutionary algorithm is used to determine the processing task arrangement on different machines. In the second part, AGV is called to transport workpieces, and an improved ant colony algorithm is used to generate the initial path of AGV. In the third part, to avoid path conflicts between running AGVs, the authors propose a simple priority-based waiting strategy to avoid collisions.
Findings
The experiment shows that the solution can effectively deal with job scheduling and multiple AGV operation problems in the workshop.
Originality/value
In this paper, a collaborative work algorithm is proposed, which combines the job scheduling and AGV running problem to make the research results adapt to the real job environment in the workshop.
Details
Keywords
Ahreum Lim, Daeun Jung and Eunsun Lee
As emerging scholars of color with transnational backgrounds, we collectively recount our socialization experiences in US higher education institutes. We explore moments of…
Abstract
Purpose
As emerging scholars of color with transnational backgrounds, we collectively recount our socialization experiences in US higher education institutes. We explore moments of betweenness as catalysts for envisioning a more inclusive academia that operates beyond the tokenism of diversity.
Design/methodology/approach
Employing betweener autoethnography (Diversi and Moreira, 2018), we inquire into the sense of impasse encountered by South Korean female emerging scholars in the field of education in becoming an outsider within the academic system.
Findings
Chronicling our shifts in perspectives of our positionality, we interweave inquiries motivating us to challenge normative pressures and map our betweener experiences onto the Wiedman and DeAngelo’s (2020) socialization model. Through this process, we wedge open in-between spaces in the socialization process that accommodate the nuanced positionality of transnational scholars.
Originality/value
Integrating postcolonial critiques on the Western-centric meritocratic academia, this piece sheds light on the complexity and fluidity of emerging transnational scholars’ socialization processes. The thick, nuanced description deepens the understanding of the complexity of their identity negotiation within the dominant logics of academia. Our inquiries interwoven through betweener autoethnography serve as guidance for mentoring international graduate students and transnational scholars.
Details
Keywords
Radha Subramanyam, Y. Adline Jancy and P. Nagabushanam
Cross-layer approach in media access control (MAC) layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data…
Abstract
Purpose
Cross-layer approach in media access control (MAC) layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data transmissions in wireless sensor network (WSN) and Internet of Things (IoT) applications. Choosing the correct objective function in Nash equilibrium for game theory will address fairness index and resource allocation to the nodes. Game theory optimization for distributed may increase the network performance. The purpose of this study is to survey the various operations that can be carried out using distributive and adaptive MAC protocol. Hill climbing distributed MAC does not need a central coordination system and location-based transmission with neighbor awareness reduces transmission power.
Design/methodology/approach
Distributed MAC in wireless networks is used to address the challenges like network lifetime, reduced energy consumption and for improving delay performance. In this paper, a survey is made on various cooperative communications in MAC protocols, optimization techniques used to improve MAC performance in various applications and mathematical approaches involved in game theory optimization for MAC protocol.
Findings
Spatial reuse of channel improved by 3%–29%, and multichannel improves throughput by 8% using distributed MAC protocol. Nash equilibrium is found to perform well, which focuses on energy utility in the network by individual players. Fuzzy logic improves channel selection by 17% and secondary users’ involvement by 8%. Cross-layer approach in MAC layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data transmissions in WSN and IoT applications. Cross-layer and cooperative communication give energy savings of 27% and reduces hop distance by 4.7%. Choosing the correct objective function in Nash equilibrium for game theory will address fairness index and resource allocation to the nodes.
Research limitations/implications
Other optimization techniques can be applied for WSN to analyze the performance.
Practical implications
Game theory optimization for distributed may increase the network performance. Optimal cuckoo search improves throughput by 90% and reduces delay by 91%. Stochastic approaches detect 80% attacks even in 90% malicious nodes.
Social implications
Channel allocations in centralized or static manner must be based on traffic demands whether dynamic traffic or fluctuated traffic. Usage of multimedia devices also increased which in turn increased the demand for high throughput. Cochannel interference keep on changing or mitigations occur which can be handled by proper resource allocations. Network survival is by efficient usage of valid patis in the network by avoiding transmission failures and time slots’ effective usage.
Originality/value
Literature survey is carried out to find the methods which give better performance.
Details
Keywords
Shilong Zhang, Changyong Liu, Kailun Feng, Chunlai Xia, Yuyin Wang and Qinghe Wang
The swivel construction method is a specially designed process used to build bridges that cross rivers, valleys, railroads and other obstacles. To carry out this construction…
Abstract
Purpose
The swivel construction method is a specially designed process used to build bridges that cross rivers, valleys, railroads and other obstacles. To carry out this construction method safely, real-time monitoring of the bridge rotation process is required to ensure a smooth swivel operation without collisions. However, the traditional means of monitoring using Electronic Total Station tools cannot realize real-time monitoring, and monitoring using motion sensors or GPS is cumbersome to use.
Design/methodology/approach
This study proposes a monitoring method based on a series of computer vision (CV) technologies, which can monitor the rotation angle, velocity and inclination angle of the swivel construction in real-time. First, three proposed CV algorithms was developed in a laboratory environment. The experimental tests were carried out on a bridge scale model to select the outperformed algorithms for rotation, velocity and inclination monitor, respectively, as the final monitoring method in proposed method. Then, the selected method was implemented to monitor an actual bridge during its swivel construction to verify the applicability.
Findings
In the laboratory study, the monitoring data measured with the selected monitoring algorithms was compared with those measured by an Electronic Total Station and the errors in terms of rotation angle, velocity and inclination angle, were 0.040%, 0.040%, and −0.454%, respectively, thus validating the accuracy of the proposed method. In the pilot actual application, the method was shown to be feasible in a real construction application.
Originality/value
In a well-controlled laboratory the optimal algorithms for bridge swivel construction are identified and in an actual project the proposed method is verified. The proposed CV method is complementary to the use of Electronic Total Station tools, motion sensors, and GPS for safety monitoring of swivel construction of bridges. It also contributes to being a possible approach without data-driven model training. Its principal advantages are that it both provides real-time monitoring and is easy to deploy in real construction applications.
Details
Keywords
Xiaobo Shi, Yaning Qiao, Xinyu Zhao, Yan Liu, Chenchen Liu, Ruopeng Huang and Yuanlong Cui
Modern subway transportation systems need to satisfy increasing safety demands to rapidly evacuate passengers under hazardous emergency circumstances, such as fires, accidents or…
Abstract
Purpose
Modern subway transportation systems need to satisfy increasing safety demands to rapidly evacuate passengers under hazardous emergency circumstances, such as fires, accidents or terrorist attacks, to reduce passenger injuries or life losses. The emergency evacuation capacity (EEC) of a subway station needs to be revised timely, in case passenger demand increases or the evacuation route changes in the future. However, traditional ways of estimating EEC, e.g. fire drills are time- and resource-consuming and are difficult to revise from time to time. The purpose of this study is to establish an intuitive modelling approach to increase the EEC of subway stations in a stepwised manner.
Design/methodology/approach
This study develops an approach to combine agent-based evacuation modelling and building information modelling (BIM) technology to estimate the total evacuation time of a subway station.
Findings
Evacuation time can be saved (33% in the studied case) from iterative improvements including stopping escalators running against the evacuation flow and modifying the geometry around escalator exits. Such iterative improvements rely on integrating agent-based modelling and BIM.
Originality/value
The agent-based model can provide a more realistic simulation of intelligent individual movements under emergency circumstances and provides precise feedback on locations of evacuation bottlenecks. This study also examined the effectiveness of two rounds of stepwise improvements in terms of operation or design to increase the EEC of the station.
Details
Keywords
Kaizheng Zhang, Jian Di, Jiulong Wang, Xinghu Wang and Haibo Ji
Many existing trajectory optimization algorithms use parameters like maximum velocity or acceleration to formulate constraints. Due to the ignoring of the quadrotor actual…
Abstract
Purpose
Many existing trajectory optimization algorithms use parameters like maximum velocity or acceleration to formulate constraints. Due to the ignoring of the quadrotor actual tracking capability, the generated trajectories may not be suitable for tracking control. The purpose of this paper is to design an online adjustment algorithm to improve the overall quadrotor trajectory tracking performance.
Design/methodology/approach
The authors propose a reference trajectory resampling layer (RTRL) to dynamically adjust the reference signals according to the current tracking status and future tracking risks. First, the authors design a risk-aware tracking monitor that uses the Frenét tracking errors and the curvature and torsion of the reference trajectory to evaluate tracking risks. Then, the authors propose an online adjusting algorithm by using the time scaling method.
Findings
The proposed RTRL is shown to be effective in improving the quadrotor trajectory tracking accuracy by both simulation and experiment results.
Originality/value
Infeasible reference trajectories may cause serious accidents for autonomous quadrotors. The results of this paper can improve the safety of autonomous quadrotor in application.
Details