- Research Article
245
- 10.1016/j.jpha.2021.02.001
Printability–A key issue in extrusion-based bioprinting
- Feb 10, 2021
- Journal of Pharmaceutical Analysis
- Saman Naghieh + 1 more +1
Printability–A key issue in extrusion-based bioprinting
Extrusion-based bioprinting enables precise spatial control over bioink deposition and offers the advantages of cost-effectiveness, versatility, and biocompatibility. While extensive research has focused on assessing bioink printability and developing printing techniques, limited attention has been directed toward the interplay among material properties, structural design, and process optimization. In this study, the relationships among the rheological behavior of the hydrogel, structural characteristics of models, and planning strategies of the path were systematically investigated. The printability of low- and high-viscosity hydrogels was evaluated through the fabrication of pattern arrays and three-dimensional (3D) grid constructs. Results indicated that low-viscosity hydrogels were more suitable for patterns involving frequent extrusion state transitions, whereas high-viscosity hydrogels facilitated steady-state, long-duration printing of three-dimensional scaffolds. To further explore structure-specific path planning, a perfusable chip comprising flat, support, wall, and overhanging features was designed and printed. To address the inherent limitations of conventional 3-axis bioprinting in fabricating large-scale unsupported overhangs, the printing path was optimized according to the rheological properties of hydrogels. Using this strategy, a 10 × 10 mm2 overhanging structure was successfully fabricated, and perfusable hydrogel chips with tunable fluid flow were produced. The chips exhibited reliable flow performance and sealing capacity with a maximum burst pressure of 1.2 kPa. Collectively, this work presents a design framework that integrates material properties with structural features to optimize path planning and printing processes, offering valuable insights for the construction of advanced 3D cell culture systems via extrusion-based bioprinting.
Printability–A key issue in extrusion-based bioprinting
Printability–A key issue in extrusion-based bioprinting
A Deep Learning Quality Control Loop of the Extrusion-based Bioprinting Process
Extrusion-based bioprinting (EBB) represents one of the most used deposition technologies in the field of bioprinting, thanks to key advantages such as the easy-to-use hardware and the wide variety of materials that can be successfully printed. In recent years, research efforts have been focused on implementing a quality control loop for EBB, which can reduce the trial-and-error process necessary to optimize the printing parameters for a specific ink, standardize the results of a print across multiple laboratories, and so accelerate the translation of extrusion bioprinted products to more impactful clinical applications. Due to its capacity to acquire relevant features from a training dataset and generalize to unseen data, machine learning (ML) is currently being studied in literature as a relevant enabling technology for quality control in EBB. In this context, we propose a robust, deep learning-based control loop to automatically optimize the printing parameters and monitor the printing process online. We collected a comprehensive dataset of EBB prints by recording the process with a high-resolution webcam. To model multiple printing scenarios, each video represents a combination of multiple parameters, including printing set-up (either mechanical or pneumatic extrusion), material color, layer height, and infill density. After pre-processing, the collected dataset was used to thoroughly train and evaluate an ad hoc defined convolutional neural network by controlling over-fitting and optimizing the prediction time of the network. Finally, the ML model was used in a control loop to: (i) monitor the printing process and detect if a print with an error could be stopped before completion to save material and time and (ii) automatically optimize the printing parameters by combining the ML model with a previously published mathematical model of the EBB process. Altogether, we demonstrated for the first time how ML techniques can be used to automatize the EBB process, paving the way for a total quality control loop of the printing process.
Read moreBioprinting 101: Design, Fabrication, and Evaluation of Cell-Laden 3D Bioprinted Scaffolds.
3D bioprinting is an additive manufacturing technique that recapitulates the native architecture of tissues. This is accomplished through the precise deposition of cell-containing bioinks. The spatiotemporal control over bioink deposition permits for improved communication between cells and the extracellular matrix, facilitates fabrication of anatomically and physiologically relevant structures. The physiochemical properties of bioinks, before and after crosslinking, are crucial for bioprinting complex tissue structures. Specifically, the rheological properties of bioinks determines printability, structural fidelity, and cell viability during the printing process, whereas postcrosslinking of bioinks are critical for their mechanical integrity, physiological stability, cell survival, and cell functions. In this review, we critically evaluate bioink design criteria, specifically for extrusion-based 3D bioprinting techniques, to fabricate complex constructs. The effects of various processing parameters on the biophysical and biochemical characteristics of bioinks are discussed. Furthermore, emerging trends and future directions in the area of bioinks and bioprinting are also highlighted. Graphical abstract [Figure: see text] Impact statement Extrusion-based 3D bioprinting is an emerging additive manufacturing approach for fabricating cell-laden tissue engineered constructs. This review critically evaluates bioink design criteria to fabricate complex tissue constructs. Specifically, pre- and post-printing evaluation approaches are described, as well as new research directions in the field of bioink development and functional bioprinting are highlighted.
Read moreDeep Neural Network Enhanced Sampling-Based Path Planning in 3D Space
Robot path planning in 3D space is a challenging problem for its complex configuration. Sampling-based algorithms have gained great success in solving path planning problems in 3D space, but the quality of the initial path is not guaranteed and the convergence to the optimal solution is slow. To address these problems, in this article, we present a novel sampling-based path planning framework enhanced by the deep neural network (DNN) with applications to 3D space. In the proposed framework, we first train the DNN with a number of successful path planning cases in 3D space. Then the DNN is utilized to predict the promising region where the feasible path probably exists for a given path planning problem. This predicted promising region serves as a nonuniform sampling heuristic to bias the sampling process of the path planner. In this way, the path planner can focus on the promising region in the exploration and exploitation process so that the path planning speed gets accelerated. We conduct numerical simulations to evaluate the performance of the proposed algorithm and the results show that it can perform much better than conventional path planning algorithms. Furthermore, we also investigate the performance of different DNN architectures for path planning in 3D space. Note to Practitioners—In this work, we aim to provide an efficient learning-based method to accelerate the robot path planning process in 3D space. Conventional path planning algorithms need to perceive the environment first, and then implement a series of calculations such as collision checking and data storing to generate a feasible path. When facing complex and high-dimensional environments, they do not perform well. But the proposed neural network method in this article can predict the promising region where the feasible path exists for any given environment. This prediction result is used to guide the path planning process so that the algorithm performance can get significantly improved. Apart from sampling-based algorithms, the proposed neural network model can also be extended to other types of path planning algorithms.
Read moreThe effect of selected process parameters on shape fidelity in extrusion-based bioprinting of natural and synthetic hydrogels
The effect of selected process parameters on shape fidelity in extrusion-based bioprinting of natural and synthetic hydrogels
Read moreOARPER-MAFO algorithm for anti-ship missile path planning
OARPER-MAFO algorithm for anti-ship missile path planning
A Reinforcement Learning Framework for Efficient Informative Sensing
Large-scale spatial data can be collected using mobile robots with sensing and navigation capabilities. Due to limited battery lifetime and scarcity of charging stations, it is important to plan informative paths so as to maximize the utility of data given a limited travel budget, which is known as the informative path planning (IPP) problem. IPP is NP-hard, and existing solutions suffer from high complexity or low optimality. In this paper, we present a novel IPP solution based on reinforcement learning (RL). The basic idea is to learn the structural characteristics of informative paths, so informative paths can be predicted. As such, when budgets change, we avoid solving the problem from scratch and thus path planning efficiency can be improved dramatically. Among the 20 path planning experiments in two areas, the proposed RL based solution achieves the best path utility in 15 experiments, compared with state-of-the-art algorithms. More importantly, the inference complexity is linear with respect to the budget (equivalently, the maximum number of steps in RL), which is lower than other solutions. Despite the NP-hardness, the path planning process can be finished within a few seconds in our experiments on two graphs of different sizes.
Read moreAutonomous navigation and adaptive path planning in dynamic greenhouse environments utilizing improved LeGO‐LOAM and OpenPlanner algorithms
The autonomous navigation of greenhouse robots depends on precise mapping, accurate localization information and a robust path planning strategy. However, the complex agricultural environment introduces significant challenges to robot perception and path planning. In this study, a hardware system designed exclusively for greenhouse agricultural environments is presented, employing multi‐sensor fusion to diminish the interference of complex environmental conditions. Furthermore, a robust autonomous navigation framework based on the improved lightweight and ground optimized lidar odometry and mapping (LeGO‐LOAM) and OpenPlanner has been proposed. In the perception phase, a relocalization module is integrated into the LeGO‐LOAM framework. Comprising two key steps—map matching and filtering optimization, it ensures a more precise pose relocalization. During the path planning process, ground structure and plant density are considered in our Enhanced OpenPlanner. Additionally, a hysteresis strategy is introduced to enhance the stability of system state transitions. The performance of the navigation system in this paper was evaluated in several complex greenhouse environments. The integration of the relocalization module significantly decreases the absolute pose error (APE) in the perception process, resulting in more accurate pose estimation and relocalization information. In our experiments, the APE was reduced by at least 24.42%. Moreover, our enhanced OpenPlanner exhibits the capability to plan safer trajectories and achieve more stable state transitions in the experiments. The results underscore the safety and robustness of our proposed approach, highlighting its promising application prospects in autonomous navigation for agricultural robots.
Read moreChaotic predator–prey biogeography-based optimization approach for UCAV path planning
Chaotic predator–prey biogeography-based optimization approach for UCAV path planning
Autonomous Robot KUKA YouBot Navigation Based on Path Planning and Traffic Signals Recognition
We present the successful demonstration of autonomous robot KUKA YouBot navigation based on path planning and traffic signals recognition. The integration of both capabilities path planning and traffic signals recognition was carried out, thanks to the integration among Robot Operating System, MATrix LABoratory software and Open Source Computer Vision Library working environments. The Robot Operating System allows the simulation of the autonomous robot navigation by using Gazebo and provides the implementation of the algorithms in simulated and real platforms. MATrix LABoratory software improves the communication tasks taking advantage of data processing tools in the path planning process. Finally, Open Source Computer Vision Library allows the traffic signals recognition by using the Scale-Invariant Feature Transform and Speeded-Up Robust Features algorithm. The integration of Robot Operating System, MATrix LABoratory software and Open Source Computer Vision Library is a promising approach to provide autonomous navigation capability in any mobile robot and in uncontrolled environments.
Read moreA new optimization-driven path planning method with probabilistic completeness for wheeled mobile robots
Wheeled mobile robots are widely utilized for environment-exploring tasks both on earth and in space. As a basis for global path planning tasks for wheeled mobile robots, in this study we propose a method for establishing an energy-based cost map. Then, we utilize an improved dual covariant Hamiltonian optimization for motion planning method, to perform point-to-region path planning in energy-based maps. The method is capable of efficiently handling high-dimensional path planning tasks with non-convex cost functions through applying a robust active set algorithm, that is, non-monotone gradient projection algorithm. To solve the problem that the path planning process is locked in weak minima or non-convergence, we propose a randomized variant of the improved dual covariant Hamiltonian optimization for motion planning based on simulated annealing and Hamiltonian Monte Carlo methods. The results of simulations demonstrate that the final paths generated can be time efficient, energy efficient and smooth. And the probabilistic completeness of the method is guaranteed.
Read moreMultiaxis wire and arc additive manufacturing for overhangs based on conical substrates
PurposeThis paper aims to present a series of approaches for three-related issues in multiaxis in wire and arc additive manufacturing (WAAM) as follows: how to achieve a stable and robust deposition process and maintain uniform growth of the part; how to maintain consistent formation of a melt pool on the surface of the workpiece; and how to fabricate an overhanging structure without supports.Design/methodology/approachThe principal component analysis-based path planning approach is proposed to compute the best scanning directions of slicing contours for the generation of filling paths, including zigzag paths and parallel skeleton paths. These printing paths have been experimented with in WAAM. To maintain consistent formation of a melt pool at overhanging regions, the authors introduce definitions for the overhanging point, overhanging distance and overhanging vector, with which the authors can compute and optimize the multiaxis motion. A novel fabricating strategy of depositing the overhanging segments as a support for the deposition of filling paths is presented.FindingsThe second principal component of a planar contour is a reasonable scanning direction to generate zigzag filling paths and parallel skeleton filling paths. The overhanging regions of a printing layer can be supported by pre-deposition of overhanging segments. Large overhangs can be successfully fabricated by the multiaxis WAAM process without supporting structures.Originality/valueAn intelligent approach of generating zigzag printing paths and parallel skeleton printing paths. Optimizations of depositing zigzag paths and parallel skeleton paths. Applications of overhanging point overhanging distance and overhanging vector for multiaxis motion planning. A novel fabricating strategy of depositing the overhanging segments as a support for the deposition of filling paths.
Read moreA hierarchic approach for path planning in virtual reality
This work considers path-planning processes for manipulation tasks such as assembly, maintenance or disassembly in a virtual reality (VR) context. The approach consists in providing a collaborative system associating a user immersed in VR and an automatic path planning process. It is based on semantic, topological and geometric representations of the environment and the planning process is split in two phases: coarse and fine planning. The automatic planner suggests a path to the user and guides him trough a haptic device. The user can escape from the proposed solution if he wants to explore a possible better way. In this case, the interactive system detects the users intention and computes in real-time a new path starting from the users guess. Experiments illustrate the different aspects of the approach: multi-representation of the environment, path planning process, users intent prediction and control sharing.
Read moreMulti-agent Collaborative Region Exploration and Path Planning Based on Q-Learning Algorithm Under Communication-Limited Condition
This paper addresses multi-agent cooperative region exploration and path planning. For region exploration, a double probability matrix updating rule based on distance weight is proposed and its convergence is proved by us. Compared with traditional Bayes updating rules, this updating rule improves the convergence speed of the exploration probability matrix and is applicable to multiple environments, thus improving the robustness. Secondly, a multi-agent region exploration strategy based on distance weight is proposed. Compared with the traditional coverage control algorithm, this method improves the search efficiency, reduces the variance of the results thus improves the confidence of the data. For path planning, a multi-agent hierarchical Q-learning algorithm is proposed and we use a multi-agent collaborative process of region exploration and path planning to visualize the influence of region exploration’s result on path planning algorithm. The above algorithm is modeled and simulated based on the cooperative search and rescue task at sea, and the simulation results verify the above conclusions.KeywordsMulti-agentRegion explorationPath planningQ-learning
Read morePath planning of manure-robot cleaners using grid-based reinforcement learning
The use of a robot cleaner for manure removal improves housing conditions for dairy cows in the face of labor shortages. However, current robot cleaners follow programmed fixed routes without considering the dynamic behaviors of cows. This cleaning approach is less efficient and leads to more cow-robot encounters or collisions, thus affecting animal welfare. To address these issues, this paper (1) developed heatmap models for cow locations and defecation behaviors; (2) proposed a dynamic path planning approach for the manure robot cleaner using Grid-based Reinforcement Learning; (3) incorporated cow location information and defecation behavior into the path planning process; (4) compared the performance of the proposed approach with two different cleaning methods: the current fixed programmed cleaning in practice and the ideal path produced by simulated annealing for traveling salesman problem. The simulations mimic the situation in a barn at Dairy Campus of Wageningen Livestock Research located in Leeuwarden (the Netherlands). Obviously, the best performance was achieved when the route was executed without cows present, resulting in no cow-robot collision. However, with cows present, the proposed dynamic path planning strategy achieved a 67.6% reduction in cow-robot encounters while maintaining 85.4% of the cleaning performance compared to the current programmed fixed routes. Compared to the ideal path produced by simulated annealing for traveling salesman problem, the proposed dynamic path planning approach achieved 5% better cleaning performance, at the cost of 25% more cow-robot encounters due to its longer working path. We conclude the proposed grid-based Reinforcement Learning solution for manure robots in barns cleaned most efficient with the least interference with cow traffic.
Read more