Research article Special Issues

Mathematical modeling of tumor growth: the MCF-7 breast cancer cell line

  • Received: 31 December 2018 Accepted: 04 July 2019 Published: 15 July 2019
  • Breast cancer is the second most commonly diagnosed cancer in women worldwide. MCF-7 cell line is an extensively studied human breast cancer cell line. This cell line expresses estrogen receptors, and the growth of MCF-7 cells is hormone dependent. In this study, a mathematical model, which governs MCF-7 cell growth with interaction among tumor cells, estradiol, natural killer (NK) cells, cytotoxic T lymphocytes (CTLs) or CD8+ T cells, and white blood cells (WBCs), is proposed. Experimental data are used to determine functional forms and parameter values. Breast tumor growth is then studied using the mathematical model. The results obtained from numerical simulation are compared with those from clinical and experimental studies. The system has three coexisting stable equilibria representing the tumor free state, a microscopic tumor, and a large tumor. Numerical simulation shows that an immune system is able to eliminate or control a tumor with a restricted initial size. A healthy immune system is able to effectively eliminate a small tumor or produces long-term dormancy. An immune system with WBC count at the low parts of the normal ranges or with temporary low NK cell count is able to eliminate a smaller tumor. The cytotoxicity of CTLs plays an important role in immune surveillance. The association between the circulating estradiol level and cancer risk is not significant.

    Citation: Hsiu-Chuan Wei. Mathematical modeling of tumor growth: the MCF-7 breast cancer cell line[J]. Mathematical Biosciences and Engineering, 2019, 16(6): 6512-6535. doi: 10.3934/mbe.2019325

    Related Papers:

    [1] Jinzhuang Xiao, Xuele Yu, Keke Sun, Zhen Zhou, Gang Zhou . Multiobjective path optimization of an indoor AGV based on an improved ACO-DWA. Mathematical Biosciences and Engineering, 2022, 19(12): 12532-12557. doi: 10.3934/mbe.2022585
    [2] Yejun Hu, Liangcai Dong, Lei Xu . Multi-AGV dispatching and routing problem based on a three-stage decomposition method. Mathematical Biosciences and Engineering, 2020, 17(5): 5150-5172. doi: 10.3934/mbe.2020279
    [3] Zhen Zhou, Chenchen Geng, Buhu Qi, Aiwen Meng, Jinzhuang Xiao . Research and experiment on global path planning for indoor AGV via improved ACO and fuzzy DWA. Mathematical Biosciences and Engineering, 2023, 20(11): 19152-19173. doi: 10.3934/mbe.2023846
    [4] Li-zhen Du, Shanfu Ke, Zhen Wang, Jing Tao, Lianqing Yu, Hongjun Li . Research on multi-load AGV path planning of weaving workshop based on time priority. Mathematical Biosciences and Engineering, 2019, 16(4): 2277-2292. doi: 10.3934/mbe.2019113
    [5] Baoye Song, Shumin Tang, Yao Li . A new path planning strategy integrating improved ACO and DWA algorithms for mobile robots in dynamic environments. Mathematical Biosciences and Engineering, 2024, 21(2): 2189-2211. doi: 10.3934/mbe.2024096
    [6] Xiaoyong Xiong, Haitao Min, Yuanbin Yu, Pengyu Wang . Application improvement of A* algorithm in intelligent vehicle trajectory planning. Mathematical Biosciences and Engineering, 2021, 18(1): 1-21. doi: 10.3934/mbe.2021001
    [7] Liwei Yang, Lixia Fu, Ping Li, Jianlin Mao, Ning Guo, Linghao Du . LF-ACO: an effective formation path planning for multi-mobile robot. Mathematical Biosciences and Engineering, 2022, 19(1): 225-252. doi: 10.3934/mbe.2022012
    [8] Tian Xue, Liu Li, Liu Shuang, Du Zhiping, Pang Ming . Path planning of mobile robot based on improved ant colony algorithm for logistics. Mathematical Biosciences and Engineering, 2021, 18(4): 3034-3045. doi: 10.3934/mbe.2021152
    [9] Xuewu Wang, Bin Tang, Xin Zhou, Xingsheng Gu . Double-robot obstacle avoidance path optimization for welding process. Mathematical Biosciences and Engineering, 2019, 16(5): 5697-5708. doi: 10.3934/mbe.2019284
    [10] Yuzhuo Shi, Huijie Zhang, Zhisheng Li, Kun Hao, Yonglei Liu, Lu Zhao . Path planning for mobile robots in complex environments based on improved ant colony algorithm. Mathematical Biosciences and Engineering, 2023, 20(9): 15568-15602. doi: 10.3934/mbe.2023695
  • Breast cancer is the second most commonly diagnosed cancer in women worldwide. MCF-7 cell line is an extensively studied human breast cancer cell line. This cell line expresses estrogen receptors, and the growth of MCF-7 cells is hormone dependent. In this study, a mathematical model, which governs MCF-7 cell growth with interaction among tumor cells, estradiol, natural killer (NK) cells, cytotoxic T lymphocytes (CTLs) or CD8+ T cells, and white blood cells (WBCs), is proposed. Experimental data are used to determine functional forms and parameter values. Breast tumor growth is then studied using the mathematical model. The results obtained from numerical simulation are compared with those from clinical and experimental studies. The system has three coexisting stable equilibria representing the tumor free state, a microscopic tumor, and a large tumor. Numerical simulation shows that an immune system is able to eliminate or control a tumor with a restricted initial size. A healthy immune system is able to effectively eliminate a small tumor or produces long-term dormancy. An immune system with WBC count at the low parts of the normal ranges or with temporary low NK cell count is able to eliminate a smaller tumor. The cytotoxicity of CTLs plays an important role in immune surveillance. The association between the circulating estradiol level and cancer risk is not significant.


    Sensible logistics are essential for advancing the manufacturing industry in the context of intelligent manufacturing. Intelligent logistics achieves process automation and intelligence by fusing cutting-edge technologies like the Internet with intelligent instruments like smart robots, in line with the objectives of intelligent manufacturing. Modern technologies like the Internet of Things, cloud computing, big data, and artificial intelligence are essential to the smart logistics distribution system. In order to ensure seamless job completion and minimize the need for human and material resources, they expedite the design of order tasks, material distribution routes, vehicle scheduling, and load capacity. This all-encompassing strategy significantly improves production and logistical efficiencies [1]. Both software and hardware are needed to construct a smart logistics system. Stackers, different conveying equipment, and automated guided vehicles (AGV) are foundational elements. The enhancement of intelligent logistics is ensured by the digital workshop control system, path planning, navigation algorithm, and optimization algorithm.

    Studies show that throughout the whole product production process, transportation, loading and unloading, and other links use three quarters of the time, while production and processing take up one quarter. Forklifts and other equipment are used in traditional transportation methods, which are dangerous, labor-intensive, and prone to mistakes. Deploying robots or AGVs as a substitute is beneficial in places with high labor costs, scarce human resources, or hazardous situations. As a component of intelligent logistics, AGV automates and simplifies the logistics transportation process, lowering labor costs in warehouses and enhancing operational effectiveness. This is in accordance with the trend of building intelligent and automated logistic systems in industrial development.

    AGVs have taken on a variety of complex responsibilities in recent years. The main goal of material distribution using AGVs is to minimize human interaction by guaranteeing efficient conveyance to the work site. Therefore, solving the AGV path planning problem in the intelligent distribution system is necessary to realize intelligent logistics in the digital workshop [2,3].

    AGV path planning has drawn a lot of interest due to its widespread applicability. The Dijkstra algorithm, A* algorithm, deep reinforcement learning algorithm, and ant colony algorithm are some of the most widely used path planning techniques. Based on the Dijkstra algorithm, Zhou and Huang [4] presented an improved method that uses the ant colony optimization strategy to optimize AGV pathways in airport situations. This model takes obstacle-filled situations into account. Results from simulations demonstrate that the combined algorithm in the airport baggage check-in path planning model performs better than three different methods. It is noteworthy that it reduces path lengths by 2.3, 2.64 and 6.06%. In order to provide collision avoidance when crossing known moving obstacles, He [5] and colleagues developed a dynamic search mechanism within the DAA (Dynamic A* Algorithm) that takes temporal considerations into account. The results of the simulations show that the DAA star algorithm performs better than the dynamic A* algorithm and the conventional A* algorithm in complex navigation scenarios. In order to learn the best decisions, Gu [6] and his associates used the Munchausen deep Q-learning network (m-DQN) for mobile robot applications. The simulation findings highlight how this approach learns more effectively and converges more quickly than DQN, Dueling DQN, and m-DQN counterparts, especially in static and dynamic situations. The technique is also very good at creating pathways that avoid collisions and go around obstructions. A group of researchers led by Miao [7] presented an improved adaptable ant colony algorithm (IaACO). Initially, angle guidance and obstacle removal parameters were integrated into the traditional ant colony algorithm (ACO) to increase the transmission probability. Second, adaptive pheromone volatilization factors and heuristic information adaptive adjustment were included to improve the pheromone update algorithms. The results of the experiment show that IaACO allows the robot to achieve global optimal pathways, exhibiting excellent planning stability and real-time performance.

    In digital manufacturing workshops, the higher computer system must quickly determine an appropriate path for the AGV in order to guarantee the effectiveness of AGV logistics. Unfortunately, the training procedure for algorithms like the ant colony algorithm, DQN, and others takes a long time [8,9,10,11,12], which makes it difficult to increase the workshop's AGV's logistical efficiency. The Dijkstra algorithm wastes time by having to search through an excessive number of nodes in the search path. As a result, the A* algorithm is selected as the fundamental algorithm in this article.

    The frequency of AGV starts and pauses, as well as the amount of time they spend navigating turns on the path, can both be greatly reduced with a streamlined path. This optimization is essential to increasing the overall effectiveness of logistics. Five spiral transition curve templates with monotonic (increasing or decreasing) curvature and cubic Bezier curve configurations were presented by Bibi et al. [13]. The benefits of cubic Bezier spiral path smoothing technology were illustrated through experimental validation. To tackle the issue of excessive nodes and spikes during path design, Duraklı [14] presented a novel solution based on Bezier curves. The results of the experiments demonstrated the effectiveness of the strategy in determining the best routes between the beginning and target points in well-known areas. Global smooth path planning for mobile robots with motion constraints was examined by Song [15]. They developed a method that combines spline curves and an improved particle swarm optimization technique. The efficiency of this strategy was demonstrated decisively by the outcomes of the experiment.

    There are still a number of issues with path smoothing, despite the large amount of research on the subject. Interestingly, a great deal of current path smoothing research projects unintentionally introduce curvature to the straight regions of the path by applying smoothing algorithms to such segments. Once smoothed, this curvature becomes detrimental to the best possible operating of AGVs. Therefore, there is a strong need to present a novel method of path smoothing that successfully takes care of this issue.

    To sum up, this post will enhance the A* algorithm on the inside as well as the outside. In order to increase the efficiency of the A* algorithm, the traditional heuristic function is first replaced with a diagonal heuristic function, and the turning cost is increased. Afterwards, redundant turns and path optimization at corners are reduced by enhancing the forward search algorithm and the Bezier curve method outside of the A* algorithm.

    The main contributions of this paper are as follows:

    1) Enhance the A* algorithm internally. We improve node traversal logic to stop pathways from intersecting barriers diagonally, which would produce erroneous paths. The search efficiency of the algorithm can be increased by using a diagonal distance heuristic function for 8 neighborhood search directions, which can more precisely estimate the expected cost from the current node to the target node. We reduce the number of nodes traveled during the path search of the A* algorithm and increase search efficiency by adding turning weights to the method's formula.

    2) On the output path of the internally improved A* algorithm, we do external optimization. The forward search optimization technique is improved and a new algorithm is suggested in this paper. This technique can identify important turning points in the path and eliminate unnecessary ones. To smooth out important turning points, this article uses an optimization technique based on Bessel curves.

    A digital manufacturing workshop serves as the path planning algorithm's application scenario in this article. Inside the manufacturing workshop, there are numerous production scenarios, unlike in ports, airports, and storage facilities. AGVs can go straight from the conclusion of one task to the beginning of the next, eliminating the requirement for them to stop and return to a fixed node while in operation. As a result, the AGVs' starting point and destination in the production workplace are dynamic, and they must be able to swiftly plan their route from one task node to the next.

    The manufacturing areas in the workshop have a basic layout, and that is where the impediments are positioned. For map modeling, this tutorial opts to utilize the grid map method. The area where an AGV may walk is shown by the white area in the grid map (Figure 1), while the area with obstacles is represented by the black area. The grid's numbering is represented by the numbers on the grid, which are written as 1,2,3,...,w from top to bottom and left to right. Arrows in eight directions grant authorization to search for paths from those eight directions. Specifically, the positive X-axis direction is defined from left to right, and the positive Y-axis direction is specified from bottom to top, starting from the bottom left corner of the grid area. Define the grid length as the unit length to establish a two-dimensional coordinate plane XOY [16]. The following is the correspondence between the grid number and coordinates:

    {x=mod(W,N)0.5,x>0x=N0.5,x<0y=N+0.5ceil(W/N) (1)
    Figure 1.  Grid map.

    In this formula, x,y represents the horizontal and vertical coordinates of the grid map, mod is a remainder operation, W is the number of the grid, N is the number of rows and columns in the grid, and ceil is the rounding function.

    The A* algorithm [19] constitutes a heuristic search-driven routing algorithm, designed for identifying the shortest path between a given starting point and an end point within a graph (or grid) structure. This approach employs an evaluation function to assess potential pathways and subsequently opts for the most promising route based on the outcome of the evaluation. Equation (2) delineates the evaluation function employed by the A* algorithm.

    f(n)=g(n)+h(n) (2)

    where f(n)is the total cost of current node n, g(n) is the actual cost from the starting point to node n, and h(n) is the estimated cost from node n to the end point.

    The algorithm maintains an open list that contains the nodes to be evaluated and a closed list that contains the evaluated nodes. The flow chart of the A* algorithm is shown in Figure 2.

    Figure 2.  A* algorithm flow chart.

    At present, the Euclidean distance, Manhattan distance, and Chebyshev distance are commonly used in the A* algorithm. The Euclidean distance is expressed as

    ho=(xexn)2+(yeyn)2 (3)

    The Manhattan distance is expressed as

    hm=|xexn|+|yeyn| (4)

    The Chebyshev distance is expressed as

    hc=max(|xexn|,|yeyn|) (5)

    where (xe,ye) is the endpoint coordinate, and (xn,yn) is the current node coordinate.

    Given that this paper designates the AGV's movement direction on the map as comprising 8 directions, both straight-line and diagonal motions of the AGV are factored into consideration. Specifically, this study presumes the cost of straight-line motion as 1 and the cost of diagonal motion as 1.4, expressed mathematically as

    g(n)={,xn=xn+1 or yn=yn+1 1.4 ,other (6)

    where (xn,yn) is the coordinates of the current node and (xn+1,yn+1) is the coordinates of the child nodes of the current node.

    The estimated cost significantly influences the search direction of the A* algorithm. An accurate estimated cost effectively gauges the expense from the present node to the destination, thereby steering the A* algorithm toward a correct search direction. The trajectories corresponding to three distinct estimated costs are illustrated in Figure 3.

    Figure 3.  Comparison of paths under different estimation functions.

    The evaluation criteria for the estimated cost function encompass the actual path cost, the count of turns, and the number of traversed nodes. As depicted in Figure 1, when employing Euclidean distance as the metric, the path's actual cost totals 30, involving 9 turns and traversing 117 nodes. Utilization of the Manhattan distance results in the algorithm primarily navigating through nodes during its search. Due to the sparse number of traversed nodes, the path derived from this estimation function might not necessarily represent the optimal trajectory. Specifically, the path under Manhattan distance exhibits an actual cost of 31.2, accompanied by 13 turns and 26 traversed nodes. When employing Chebyshev distance, the path incurs the highest tally of turns and traversed nodes, at 14 turns and 172 nodes, with an actual cost of 30. A comprehensive comparison of evaluation metrics under the three distinct estimated cost functions is detailed in Table 1.

    Table 1.  Comparison of results.
    h(n) Actual cost Number of turns traversal nodes
    Euclidean distance 30 9 117
    Manhattan distance 31.2 13 26
    Chebyshev distance 30 14 172

     | Show Table
    DownLoad: CSV

    To sum up, this paper selects Euclidean distance as the estimated cost function when improving the A* algorithm.

    1) Optimize node traversal logic. In the conventional employment of the A* algorithm for path planning, the algorithm stores the traversed nodes within a closed list. Within this list, any two nodes that share a relationship are regarded as interconnected. However, this approach can lead to an issue wherein the final planned path navigates between the vertices of two obstacles, as visually demonstrated in Figure 4. Consequently, the planned path might prove impractical for real-world applications.

    Figure 4.  Schematic diagram of the path passing through the middle of the obstacle.

    To address the aforementioned issues, this study enhances the node traversal logic within the traditional A* algorithm. The function Node_traversal() is constructed. When the A* algorithm is traversing the nodes, it judges whether the upper, lower, left, and right adjacent nodes of the visited node (i,j) are obstacles. When the upper and right adjacent nodes of the node are obstacles, it skips traversing the adjacent node (i+1,j+1) in the upper right direction of the node and does not put it into the close list, so as to avoid the nodes. This adjustment prevents scenarios where paths inadvertently pass through the interstices between two obstacles located at opposing corners, as depicted in Figure 5. Under the refined node traversal logic, as the traversal progresses to node (2.5, 1.5), the presence of obstacles above and to the right of this node prevents the inclusion of point (3.5, 2.5) in the closed list.

    Figure 5.  Schematic diagram of improved node traversal logic.

    The pseudo code of function Node_traversal() is shown in Algorithm 1.

     

    Algorithm 1
    1. Direction = [(0, 1), (0, -1), (1, 0), (-1, 0)]
    2. Current = (i, j)
    3. For each direction in Direction do
    4.  Neighbor = Current + each direction
    5.  If up_ Neighbor = obstacle and right_ Neighbor = obstacle do
    6.    Pass
    7.  If up_ Neighbor = obstacle and left_ Neighbor = obstacle do
    8.    Pass
    9.  If down_ Neighbor = obstacle and right_ Neighbor = obstacle do
    10.    Pass
    11.  If down_ Neighbor = obstacle and left_ Neighbor = obstacle do
    12.    Pass
    13. End

    In the pseudo code, the initial line defines the four cardinal directions: up, down, left, and right. The second line designates the presently traversed node, referred to as "current". Subsequently, lines 3 and 4 establish a loop to sequentially access the four adjacent nodes to the current node through the iterative process. Lines 5 and 6 are formulated to avoid traversing the upper-right node if both the upper and right sides of the current node are obstructed. Similarly, lines 7 and 8 are designed to bypass traversal of the upper-left node in scenarios where the upper and left sides of the current node are obstructed. Analogously, lines 9 and 10, as well as lines 11 and 12, serve to prevent traversal of the lower-right and lower-left nodes, respectively, under conditions where the corresponding sides of the current node are occupied by obstacles.

    The improved A* algorithm successfully mitigates the challenge of navigating through the vertices within obstacles, thereby enabling the A* algorithm to formulate a more rational path. The operational outcome of the improved A* approach is visually illustrated in Figure 6. Notably, as demonstrated in the figure, when the node's traversal reaches the coordinates (10.5, 11.5), the search does not encompass a node located at (11.5, 12.5).

    Figure 6.  Algorithm running results of improved node traversal logic.

    2) Replacing the conventional cost estimation function. While the A* algorithm utilizing Euclidean distance can find the shortest path with fewer traversed nodes, it might result in a higher number of turns within the path, as illustrated in Figure 7.

    Figure 7.  Path under euclidean distance.

    Under such circumstances, the smooth operation of the AGV would be compromised. Therefore, this study replaces the Euclidean distance with diagonal distance in order to achieve a more accurate representation of the cost estimation function from the current point to the destination. This enhancement better guides the A* algorithm in finding the optimal path. The formula for diagonal distance is as follows:

    hd(n)=min(|xnxe|,|ynye|),hs(n)=|xnxe|+|ynye|,htotal(n)=D1×hd+D2×(hs2×hd), (7)

    Among these, hd represents the cost in the diagonal direction, hs represents the cost in the straight line direction, (xn,yn) represents the current node coordinate, (xe,ye) represents the target node coordinate, htotal represents the diagonal distance calculation formula, and D1, D2 represent parameters, where D1 is 1 and D2 is 1.4.

    Upon employing diagonal distance, the planned path effectively reduces the count of redundant turns and the number of traversed nodes, as depicted in Figure 8.

    Figure 8.  Paths under diagonal distance.

    3) Increase the cost of turning. The conventional A* algorithm predominantly employs length as the primary criterion, prioritizing the attainment of the shortest overall distance as the optimal path. However, an exclusive focus on minimizing length may result in frequent turns by the AGV during its movement. In practical scenarios, the act of acceleration and deceleration during turning substantially escalates the time expense, rendering it considerably higher than that incurred during linear motion. This divergence in time costs undermines overall efficiency and hampers the attainment of a smooth path. To address this concern, this paper introduces an enhancement to the calculation formula of the conventional A* algorithm. This enhancement entails the incorporation of a turning cost into the original calculation formula. By introducing this turning cost, the aim is to curtail the frequency of turns within the path, thereby fostering a more streamlined trajectory.

    When accounting for the turning cost, it becomes imperative to initially assess the occurrence of a turn. In this investigation, the analysis employs the three-point collinear method for turn detection. This method involves utilizing three nodes and applying Eq (8) to perform the calculation.

    K=(xnxn1)×(yn+1yn)(ynyn1)×(xn+1xn) (8)

    where (xn1,yn1) is the parent node of the current node, (xn,yn) is the current node, and (xn+1,yn+1) is the current node sub node. The node relationship is shown in Figure 9.

    Figure 9.  Node relationship.

    For a straight-line path, Eq (8) yields a K value of 0. However, during turning maneuvers, distinct K values emerge. Specifically, based on the outcomes of Eq (8), a left turn corresponds to a K value of -1, while a right turn corresponds to a K value of 1. In this study, the costs associated with left and right turns are not individually considered, but rather are collectively regarded as turning costs. Consequently, the expression for the C value is illustrated in Eq (9).

    C={1 ,K=01.2 ,others (9)

    where C is the turning cost.

    To sum up, the improved A* formula is:

    f(n)=g(n)+C×htotal(n) (10)

    Under these conditions, the A* algorithm with improved heuristic function will give priority to traversing nodes in the current direction during the node search process, which will minimize the exploration of nodes in other directions. In Figure 10, the concept is displayed. Figure 10(a), (b) depict the search procedure using conventional heuristic functions and weighted heuristic functions, respectively. It is evident that node (2.5, 1.5) determines which child nodes are selected differently between the two. When choosing child nodes, weighted heuristic functions incur a higher cost at point (2.5, 2.5) since (2.5, 1.5) is the turning point, whereas traditional heuristic functions execute a turning point at node (2.5, 1.5). Therefore, the weighted heuristic functions continue to search in the original direction, reducing the number of turning points and traversing nodes in the path.

    Figure 10.  Weighted heuristic function search process.

    The objective of this section is to conduct further path optimization based on the output path generated by the A* algorithm. This process is chiefly divided into two primary steps: Path Optimization: Initially, the path is optimized to eliminate extraneous turning points present within it; Bezier Curve Fitting: Subsequently, the remaining turning points are subjected to a fitting process using Bezier curves.

    1) Path optimization

    While the internal enhancements applied to the A* algorithm effectively curtail the occurrence of turns within the path, it is important to acknowledge that the path's optimality remains contingent on the constraints of the grid map. Consequently, the resultant path might not always be the absolute optimal solution, and some degree of turns may still persist. As illustrated in Figure 11, an excessive number of turns can extend the logistics duration, thereby substantially diminishing logistics efficiency within the production workshop setting.

    Figure 11.  Grid map restrictions.

    To solve this problem, this paper adopts a path optimization method based on forward search optimization [25]. The optimization process of this method is shown in Figure 12: First, define the set of input path nodes. Then, take the starting node of the path as the current vertex, search the subsequent path nodes, find the last key node k1 connected with the starting point (connectivity means that the connection between the starting point and k1 point does not pass through obstacles), connect the starting point with k1, then take k1 as the starting point, search the points after k1 with the same logic, and set these key points to k2, k3 in turn. Then, insert the sampling point si on the path, take s10 (the k2 point in the previous step) as the current key point, and check whether the connection between s1s5 and s10 will pass through obstacles. If there are none, take s13 (the k3 point in the previous step) as the current key point, and check whether the connection between s1s9 and s10 will pass through obstacles. Since point s7 is the first point that can be connected with s13, s7 is taken as the new key point k2. Then, connect s7 and s13 to form the second optimization path, and s1s7 is optimized by using similar methods. Finally, the final optimization path is obtained.

    Figure 12.  Process diagram of forward search optimization method.

    While the concept behind the path optimization method is viable, the execution process proves excessively intricate. Consequently, this paper introduces an improved forward search optimization approach. This improved method is primarily segmented into the subsequent steps:

    Step 1. The output path set P=([x1,y1],[x2,y2],,[xi,yi]) of the A* algorithm is interpolated. The interpolation method employed here is uniform interpolation, wherein a new node is inserted between two given points. This process can be mathematically represented as

    {xnew=xn+1xn2ynew=yn+1yn2 (11)

    where (xnew,ynew) are the coordinates of the inserted new node, (xn,yn) are the coordinates of the current node, and (xn+1,yn+1) are the coordinates of the child nodes of the current node.

    Take the interpolated path set Pnew=([x1,y1],[xnew,ynew],[x2,y2],,[xi,yi]) as a new path set.

    Step 2. Construct a key point set K and an obstacle vertex set Ovc. Starting from the initial point, perform a forward search to identify the first point connected to the initial point and also present in the set Ovc. Label this point as k1 and add it to K.

    Step 3. Set k1 as the new starting point, repeat Step 2, and designate the subsequent points as k2,k3,,ki, with i representing the number of key points.

    Step 4. Repeat Step 3 to obtain the final set of key points, denoted as K.

    Step 5. Connect all key points in K to achieve path optimization.

    The process diagram of the improved forward search optimization method proposed in this paper is shown in Figure 13.

    Figure 13.  Process diagram of the improved forward search optimization method in this paper.

    The pseudo code is shown in Algorithm 2

    Algorithm 2
    1: function INSERT_NEW_NODES_BETWEEN_POINTS(P)
    2:  p_new{}
    3:  for i0 to len (P)-1 do
    4:    p_new.append (P [i])
    5:    x1, y1P [i]
    6:    x2, y2P [i + 1]
    7:    new_node((x1 + x2) / 2, (y1 + y2) / 2)
    8:    p_new.append (new_node)
    9:  end for
    10:  p_new.append (P [-1])
    11:  return p_new
    12: end function
    13: function FIND_PATH (P)
    14:  p_newinsert_new_nodes_between_points (P)
    15:  Ovc[]
    16:  K[]
    17:  K.append(p_new [0])
    18:  startp_new [0]
    19:  for jp_new.index (start) + 1 to len (p_new) do
    20:    if line (start, p_new [j]) and p_new [j-1]Ovc then
    21:      K. append (p_new [j-1])
    22:      startp_new [j-1]
    23:    end if
    24:  end for
    25:  K.append (p_new [-1])
    26:  return K
    27: end function

    In the pseudo code of Algorithm 2, lines 1 to 12 correspond to the process in Step 1. Lines 13 to 26 correspond to the process in Steps 2–4. The line(start,p_new[j]) function is used to determine whether start points are connected with p_new[j] points.

    2) Path smoothing

    The smoothing of the path refers to the use of Bezier curves, spline interpolation curves, and other methods to fit the path by using the curve to improve the smoothness of the path.

    Although the optimized path greatly reduces turning, the turning point intersects with the vertex of the obstacle, and the AGV may collide with the obstacle when passing by. Therefore, the path must be adjusted for obstacle avoidance before curve fitting.

    First, the relationship between the optimized path and the nearby obstacles is analyzed, as shown in Figure 14, where the gray grid indicates the location of the possible obstacles.

    Figure 14.  Schematic diagram of grid with possible obstacles around.

    Based on this, to ensure a certain safe distance between the path and the obstacle, the obstacle avoidance adjustment process proposed in this paper is presented as follows:

    Step 1. Calculate the direction vector of k1 and obstacle coordinates according to Eq (12).

    a=(xobstaclexk1,yobstacleyk1) (12)

    where a is the direction vector, (xobstacle,yobstacle) is the obstacle coordinate, and (xk1,yk1) is the k1 coordinate.

    Step 2. Move one half of the grid distance in the opposite direction of k1 along the direction vector as follows:

    (xk1_n,yk1_n)=(xk1,yk1)L2a (13)

    where (xk1_n,yk1_n) represents the new coordinates of k1, and L represents the width of the grid.

    Step 3. Update k1 coordinates, build the linear equation from the starting point to k1, and assess the distance between the obstacle coordinates and the straight line. When the distance is less than L, set the nearest vertex from the obstacle to the straight line to kinsert and repeat Steps 1 and 2. At this time, k1 in Steps 1 and 2 is kinsert, and the obstacle avoidance of the path is completed. kinsert is located between the starting point and k1.

    Step 4. After completing the obstacle avoidance operation from the starting point to k1, make k1 a new starting point and repeat Steps 1 to 3 to complete the obstacle avoidance of the entire road.

    The process is shown in Figure 15.

    Figure 15.  Path after obstacle avoidance.

    Then, the second-order Bezier curve is used to fit the rotation angle. The second-order Bezier curve is mathematically expressed as

    B(t)=(1t)2P0+2t(1t)P1+t2P2,t[0,1] (14)

    where P0, P1, and P2 are the three control points, and t is a parameter.

    In this paper, the selection method of control points P0 and P2 is explained as follows. First, calculate the direction vectors of kinsert and k1 coordinates and the starting line and the next node line. Second, use a similar method in obstacle avoidance adjustment to select P0 and P2 control points on the two paths with length L as the distance. Finally, kinsert and k1 are used as P1 control points to achieve curve fitting at turns, as shown in Figure 16.

    Figure 16.  Path after curve fitting.

    After improving the traditional A* algorithm in Sections 4.1 and 4.2, the AGV path planning method based on the improved A* algorithm can be illustrated by the flow chart in Figure 17.

    Figure 17.  Flow chart of the AGV path planning method based on the improved A* algorithm.

    Comprehensive experiments were conducted on the Pycharm 2022.3 platform. The programming language is Python 3.10. The performance of the proposed improved A* algorithm was tested, and the framework used by the DQN network was TensorFlow. The performance parameters of the execution host are Windows 10, and the hardware parameters are Intel(R) core(TM) i5-8250U CPU, 1.6 GHz, x64, 8 GB (RAM).

    The obstacles in the production workshop are each production area. These production areas are usually large in area and simple in shape. Therefore, this article simulates and constructs maps with sizes of 20 × 20, 30 × 30, and 40 × 40 based on the characteristics of obstacles in the production workshop, as shown in Figure 18.

    Figure 18.  Grid map used in the experiment.

    This study uses path length, turning angle, number of traversal nodes, and algorithm running time as evaluation indices. The length of the path indicates the true cost of the path. The turning angle is the total of the degrees the AGV must turn in order to travel down the course. The number of nodes that the algorithm traverses in order to locate the path is represented by the number of traversal nodes. The algorithm's running time shows how long the path is searched throughout that period.

    This paper uses both theoretical and simulated experiments for its experimental section. In the theoretical experimental part, the internal improved A* algorithm is first compared with other algorithms, and then the improved forward search optimization algorithm is verified. A custom path planner in the ROS system is used in the simulation experiment section of this article to use the traditional A* algorithm, internally improved A* algorithm, and improved A* algorithm as plugins. Simulation verification is carried out by calling algorithm plugins.

    The algorithms involved in the comparison include the traditional A* algorithm, Dijkstra algorithm, bidirectional A* algorithm, ant colony algorithm, DQN algorithm, and the internal improved A* algorithm in this paper. The starting point is the (0.5, 0.5) point, and the ending point is the point in the upper right corner. The cyan and red grids in the grid graph represent the traversed nodes. The parameters of the ant colony algorithm are shown in Table 2, and the parameters of the DQN algorithm are shown in Table 3.

    Table 2.  Ant colony algorithm parameters.
    parameter value
    Number of ants 20
    Number of iterations 150
    Pheromone evaporation rate 0.5
    pheromone factor 1.1
    heuristic function factor 4

     | Show Table
    DownLoad: CSV
    Table 3.  DQN algorithm parameters.
    parameter value
    Learning rate 0.001
    Discount factor 0.995
    Exploration rate 0.4
    Batch size 64

     | Show Table
    DownLoad: CSV

    As shown in Figure 19, when comparing the ant colony method to other algorithms at a 20 × 20 grid map, it yielded the longest path length, with the other algorithms obtaining the same path length. The turning angle of the traditional A*, bidirectional A*, ant colony algorithm, DQN algorithm, and Dijkstra method has grown by 135,135,315,135, and 90°, respectively. The ant colony algorithm and DQN algorithm have distinct search algorithms from the others, therefore, the indicator of the number of traversal nodes is not considered, however, the traditional A* algorithm, bidirectional A* algorithm, and Dijkstra algorithm have increased by 43, 35, and 285, respectively. Algorithm running times rose by 0.51 s for the traditional A* algorithm, 0.24 s for the bidirectional A* method, 4.59 s for the ant colony algorithm, 4.33 s for the DQN algorithm, and 1.59 s for the Dijkstra algorithm.

    Figure 19.  20 × 20 comparison of results in the map.

    As shown in Figure 20, the conventional A* algorithm outperforms the internal improved A* algorithm on a 30 × 30 grid map in terms of path length, number of traversed nodes, and algorithm running time. The bidirectional A* algorithm outperforms the internal improved A* algorithm in terms of both these metrics. The ant colony and DQN algorithms outperform the internal improved A* algorithm in terms of path length. Although in some indicators the comparison algorithm outperforms the internal improved A* algorithm, the comparison algorithm's planned path, which goes from nodes (20.5, 19.5) to (21.5, 20.5), diagonally passes through two obstacle nodes (20.5, 20.5) and (19.5, 21.5), making the expected path AGV invalid. This illustration confirms that the A* algorithm's internal improvement can prevent the creation of erroneous pathways.

    Figure 20.  30 × 30 comparison of results in the map.

    As shown in Figure 21, the ant colony algorithm produced the longest path length on a 40 × 40 grid map when compared to other algorithms, and the other algorithms produced the same path length. The turning angle of the traditional A*, bidirectional A*, ant colony algorithm, DQN algorithm, and the Dijkstra algorithm has risen by 135,315,360,225, and 45°, respectively. Regarding traversing the number of nodes, the traditional A* algorithm, bidirectional A* algorithm, and Dijkstra algorithm have increased by 12, 87, and 863 respectively; however, there is no need to traverse the number of nodes because the ant colony algorithm and DQN algorithm have different search mechanisms than the others. Algorithm running times rose by 0.76 s for the traditional A* algorithm, 0.47 s for the bidirectional A* method, 10.47 s for the ant colony algorithm, 9.54 s for the DQN algorithm, and 2.05 s for the Dijkstra algorithm.

    Figure 21.  40 × 40 comparison of results in the map.

    The specific experimental results of each algorithm are shown in Table 4.

    Table 4.  Comparison of results in different environments.
    Map Algorithm Length Turning angle Number of traversal nodes Algorithm run time
    20 × 20 Traditional A* 30.2 270° 104 1.29 s
    Bidirectional A* 30.2 270° 96 1.02 s
    Ant Colony 31.6 450° \ 5.37 s
    DQN 30.2 270° \ 5.11 s
    Dijk stra 30.2 225° 346 2.37 s
    Internally improved A* 30.2 135° 61 0.78 s
    30 × 30 Traditional A* 43.6 360° 151 1.35 s
    Bidirectional A* 45.4 315° 162 1.24 s
    Ant Colony 43.6 540° \ 8.32 s
    DQN 43.6 225° \ 9.43 s
    Dijk stra 43.6 405° 764 2.43 s
    Internally improved A* 45.4 225° 206 1.34 s
    40 × 40 Traditional A* 60.6 270° 362 2.32 s
    Bidirectional A* 65.2 450° 437 2.03 s
    Ant Colony 68.6 495° \ 12.03 s
    DQN 65.4 360° \ 11.10 s
    Dijk stra 62.2 180° 1213 3.61 s
    Internally improved A* 60.6 135° 350 1.56 s

     | Show Table
    DownLoad: CSV

    In summary, this comparison demonstrates the usefulness of the internal modification of the A* algorithm in this work by demonstrating the modified algorithm's good performance in terms of path length, turning angle, number of traversal nodes, and algorithm running time.

    This part is dedicated to path optimization and smoothing verification. The path generated by the internally enhanced A* algorithm serves as the initial path input and is subsequently smoothed and optimized. The comparative algorithms are the internally enhanced A* algorithm and the improved A* algorithm (with both external and internal enhancements). The turning angle and length of the path act as assessment marks. In Figure 22, the blue dotted line represents the initial path, the green dotted line represents the optimized path, and the red solid line represents the final smoothed path.

    Figure 22.  Path optimization and smoothing verification.

    As can be seen from Table 5, based on the internal improved A* algorithm, after optimizing and smoothing the path, the path length and turning angle obtained are both shorter than the path obtained by the internal improved A* algorithm. In the 20 × 20 map, compared with the internal improved A* algorithm results, the final improved A* algorithm path length is reduced by 4.4, and the turning angle is reduced by 88.49°. In the 30 × 30 map, compared with the internal improved A* algorithm results, the final improved A* algorithm path length is reduced by 4.7, and the turning angle is reduced by 176.79°. In the 40 × 40 map, compared with the internal improved A* algorithm results, the final improved A* algorithm path length is reduced by 5.2, and the turning angle is reduced by 85.69°. It shows that the improved A* algorithm proposed in this article can effectively reduce the length of the path and the turning angle in the path, and can effectively reduce the distance and steering angle of the AGV, ensuring the smoothness of AGV driving.

    Table 5.  Comparison of path optimization and smoothing results.
    Map Algorithm Length Turning angle
    20 × 20 Internally improved A* 30.2 135°
    Improved A* 25.8 46.51°
    30 × 30 Internally improved A* 45.4 225°
    Improved A* 40.7 48.21°
    40 × 40 Internally improved A* 60.6 135°
    Improved A* 55.4 49.31°

     | Show Table
    DownLoad: CSV

    This article's suggested algorithm has been verified in ROS. Using the 20 × 20 map as an example, just the essential components of the map were built during the modeling of the map SLAM technique in order to conserve computing power. Figure 23 displays the simulation results. The path is represented by the green line, open space is represented by the gray section, and obstacle boundaries are displayed by the black part.

    Figure 23.  Simulation results.

    The paths designed by the conventional A* algorithm are depicted in Figure 23(a), the internally improved A* method in Figure 23(b), and the improved A* algorithm in Figure 23(c). The three paths take the AGV 21, 15, and 9 seconds to complete, respectively. This demonstrates that the path quality predicted by the revised A* method put forth in this research is high, which can shorten the AGV's running time and increase its effectiveness.

    Although the A* algorithm has the advantages of being a simple algorithm and having a fast search speed, the planned path may involve more turns and the path may not be smooth enough. In order to solve this problem, this paper improves the internal and external properties of the traditional A* algorithm. The node traversal logic of the A* algorithm is internally optimized to avoid the path passing between two obstacle vertices. Subsequently, the cost estimation function was modified to replace the traditional Euclidean distance with the diagonal distance, thereby improving the accuracy of cost prediction. This adjustment effectively reduces the number of redundant turns within the path. Then, the weight of the cost estimation function of the A* algorithm is added to give priority to the current search direction when finding a path, thereby reducing the number of nodes traversed and the number of turns compared to the traditional A* algorithm. Finally, a path optimization smoothing method based on the improved forward search optimization method and Bezier curve method is proposed. This method is used in addition to the A* algorithm to eliminate redundant turning points in the path and perform curve fitting at turns to improve the smoothness of the path.

    Finally, the experimental results show that the internal modification of the A* algorithm avoids planning invalid paths, reduces the number of turns, reduces the number of traversed nodes, and shortens the search time. After external modifications to the A* algorithm, the number of turns in the path is further reduced and the length of the path is shortened.

    Although the path planning method based on the improved A* algorithm proposed in this article can effectively make up for the shortcomings of the traditional A* algorithm, it still encounters some shortcomings and defects:

    1) In the actual workshop environment, the location of obstacles cannot be accurately located, but dynamic obstacles may appear, and the method proposed in this article is based on the path planning method in a static obstacle environment.

    2) The improved A* algorithm proposed in this article is suitable for environments with concentrated obstacles such as workshops, but is not suitable for areas with many and scattered obstacles, such as in warehousing environments.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors thank the anonymous reviewers for their valuable comments. This work was supported by high level Project of Shihezi University (No. RCZK2021B16); The high-level project led by Professor Baoqin Wen at Shihezi University (No. RCZK202310).

    The authors declare there is no conflict of interest



    [1] D. R. Jutagir, B. B. Blomberg, C. S. Carver, et al., Social well-being is associated with less pro-inflammatory and pro-metastatic leukocyte gene expression in women after surgery for breast cancer, Breast Cancer Res. Treat., 165 (2017), 169–180.
    [2] S. Katkuri and M. Gorantla, Awareness about breast cancer among women aged 15 years and above in urban slums: a cross sectional study, Int. J. Community Med. Public Health, 5 (2018), 929–932.
    [3] A. Pawlik, M. Slomi´ nska-Wojewódzka and A. Herman-Antosiewicz, Sensitization of estrogen receptor-positive breast cancer cell lines to 4-hydroxytamoxifen by isothiocyanates present in cruciferous plants, Eur. J. Nutr., 55 (2016), 1165–1180.
    [4] D. L. Holliday and V. Speirs, Choosing the right cell line for breast cancer research, Breast Cancer Res., 13 (2011), 215–215.
    [5] R. L. Sutherland, R. E. Hall and I. W. Taylor, Cell proliferation kinetics of MCF-7 human mammary carcinoma cells in culture and effects of tamoxifen on exponentially growing and plateau-phase cells, Cancer Res., 43 (1983), 3998–4006.
    [6] B. S. Katzenellenbogen, K. L. Kendra, M. J. Norman, et al., Proliferation, hormonal responsiveness, and estrogen receptor content of MCF-7 human breast cancer cells grown in the short-term and long-term absence of estrogens, Cancer Res., 47(1987), 4355–4360.
    [7] A. Maton, Human biology and health, 1st edition, Prentice Hall, New Jersey, 1997.
    [8] L. V. Rao, B. A. Ekberg, D. Connor, et al., Evaluation of a new point of care automated complete blood count (CBC) analyzer in various clinical settings, Clin. Chim. Acta., 389 (2008), 120–125.
    [9] S. Bernard, E. Abdelsamad, P. Johnson, et al., Pediatric leukemia: diagnosis to treatment a review, J. Cancer Clin. Trials, 2(2017), 131.
    [10] A. Shankar, J. J. Wang, E. Rochtchina, et al., Association between circulating white blood cell count and cancer mortality: a population-based cohort study, Arch. Intern. Med., 166 (2006), 188–194.
    [11] K. Kim, J. Lee, N. J. Heo, et al., Differential white blood cell count and all-cause mortality in the Korean elderly, Exp. Gerontol., 48 (2013), 103–108.
    [12] C. Ruggiero, E. J. Metter, A. Cherubini, et al., White blood cell count and mortality in the Baltimore Longitudinal Study of Aging, J. Am. Coll. Cardiol., 49 (2007), 1841–1850.
    [13] D. S. Bell and J. H. O'Keefe, White cell count, mortality, and metabolic syndrome in the Baltimore longitudinal study of aging, J. Am. Coll. Cardiol., 50(2007), 1810.
    [14] G. D. Friedman and B. H. Fireman, The leukocyte count and cancer mortality, Am. J. Epidemiol., 133 (1991), 376–380.
    [15] M. H. Andersen, D. Schrama, P. thor Straten, et al., Cytotoxic T cells, J. Invest. Dermatol., 126 (2006), 32–41.
    [16] J. Folkman and R. Kalluri, Cancer without disease, Nature, 427 (2004), 787.
    [17] T. Fehm, V. Mueller, R. Marches, et al., Tumor cell dormancy: implications for the biology and treatment of breast cancer, Apmis, 116 (2008), 742–753.
    [18] N. Almog, Molecular mechanisms underlying tumor dormancy, Cancer Lett., 294 (2010), 139–146.
    [19] A. Friedman, Cancer as multifaceted disease, Math. Model. Nat. Pheno., 7(2012), 3–28.
    [20] R. Eftimie, J. L. Bramson and D. J. Earn, Interactions between the immune system and cancer: a brief review of non-spatial mathematical models, Bull. Math. Biol., 73 (2011), 2–32.
    [21] S. Banerjee and R. R. Sarkar, Delay-induced model for tumor–immune interaction and control of malignant tumor growth, Biosystems, 91 (2008), 268–288.
    [22] H. Moore and N. K. Li, A mathematical model for chronic myelogenous leukemia (CML) and T cell interaction, J. Theor. Biol., 227 (2004), 513–523.
    [23] L. Anderson, S. Jang and J. Yu, Qualitative behavior of systems of tumor-CD4+-cytokine interactions with treatments, Math. Method. Appl. Sci., 38 (2015), 4330–4344.
    [24] A. d'Onofrio, Metamodeling tumor–immune system interaction, tumor evasion and immunotherapy, Math. Comput. Model., 47 (2008), 614–637.
    [25] A. Khar, Mechanisms involved in natural killer cell mediated target cell death leading to spontaneous tumour regression, J. Biosci., 22 (1997), 23–31.
    [26] T. Boon and P. van der Bruggen, Human tumor antigens recognized by T lymphocytes, J. Exp. Med., 183 (1996), 725–729.
    [27] D. Kirschner and J. C. Panetta, Modeling immunotherapy of the tumor–immune interaction, J. Math. Biol., 37 (1998), 235–252.
    [28] L. G. de Pillis, W. Gu and A. E. Radunskaya, Mixed immunotherapy and chemotherapy of tumors: modeling, applications and biological interpretations, J. Theor. Biol., 238 (2006), 841–862.
    [29] H. P. de Vladar and J. A. González, Dynamic response of cancer under the influence of immunological activity and therapy, J. Theor. Biol., 227 (2004), 335–348.
    [30] U. Fory´ s, J. Waniewski and P. Zhivkov, Anti-tumor immunity and tumor anti-immunity in a mathematical model of tumor immunotherapy, J. Biol. Syst., 14 (2006), 13–30.
    [31] R. W. De Boer, J. M. Karemaker and J. Strackee, Relationships between short-term blood-pressure fluctuations and heart-rate variability in resting subjects I: a spectral analysis approach, Med. Biol. Eng. Comput., 23 (1985), 352–358.
    [32] A. Cappuccio, M. Elishmereni and Z. Agur, Cancer immunotherapy by interleukin-21: potential treatment strategies evaluated in a mathematical model, Cancer Res., 66 (2006), 7293–7300.
    [33] N. Kronik, Y. Kogan, V. Vainstein, et al., Improving alloreactive CTL immunotherapy for malignant gliomas using a simulation model of their interactive dynamics, Cancer Immunol. Immunother., 57 (2008), 425–439.
    [34] A. M. Jarrett, J. M. Bloom, W. Godfrey, et al., Mathematical modelling of trastuzumab-induced immune response in an in vivo murine model of HER2+ breast cancer, Math. Med. Biol., (2018), dqy014.
    [35] K. Annan, M. Nagel and H. A. Brock, A mathematical model of breast cancer and mediated immune system interactions, J. Math. Syst. Sci., 2(2012), 430–446.
    [36] R. Roe-Dale, D. Isaacson and M. Kupferschmid, A mathematical model of breast cancer treatment with CMF and doxorubicin, Bull. Math. Biol., 73 (2011), 585–608.
    [37] B. Ribba, N. H. Holford, P. Magni, et al., A review of mixed-effects models of tumor growth and effects of anticancer drug treatment used in population analysis, CPT Pharmacometrics Syst. Pharmacol., 3(2014), 1–10.
    [38] R. Bhat and C. Watzl, Serial killing of tumor cells by human natural killer cells–enhancement by therapeutic antibodies, PloS One, 2 (2007), e326.
    [39] T. Sutlu and E. Alici, Natural killer cell-based immunotherapy in cancer: current insights and future prospects, J. Intern. Med., 266 (2009), 154–181.
    [40] T. R. Stravitz, T. Lisman, V. A. Luketic, et al., Minimal effects of acute liver injury/acute liver failure on hemostasis as assessed by thromboelastography, J. Hepatol., 56 (2012), 129–136.
    [41] Y. Zhang, D. L. Wallace, C. M. De Lara, et al., In vivo kinetics of human natural killer cells: the effects of ageing and acute and chronic viral infection, Immunotherapy, 121(2007), 258–265.
    [42] P. Wilding, L. J. Kricka, J. Cheng, et al., Integrated cell isolation and polymerase chain reaction analysis using silicon microfilter chambers, Anal. Biochem., 257(1998), 95–100.
    [43] V. Pascal, N. Schleinitz, C. Brunet, et al., Comparative analysis of NK cell subset distribution in normal and lymphoproliferative disease of granular lymphocyte conditions, Eur. J. Immunol., 34(2004), 2930–2940.
    [44] L. de Pillis, T. Caldwell, E. Sarapata, et al., Mathematical modeling of the regulatory T cell effects on renal cell carcinoma treatment, Discrete Continuous Dyn. Syst. Ser. B, 18(2013), 915–943.
    [45] T. D. To, A. T. T. Truong, A. T. Nguyen, et al., Filtration of circulating tumour cells MCF-7 in whole blood using non-modified and modified silicon nitride microsieves, Int. J. Nanotechnol., 15(2018), 39–52.
    [46] C. Chen, Y. Chen, D. Yao, et al., Centrifugalfilter device for detection of rare cells with immuno-binding, IEEE T. Nanobiosci., 14(2015), 864–869.
    [47] P. Dua, V. Dua and E. N. Pistikopoulos, Optimal delivery of chemotherapeutic agents in cancer, Comput. Chem. Eng., 32(2008), 99–107.
    [48] A. G. López, J. M. Seoane and M. A. Sanjuán, A validated mathematical model of tumor growth including tumor–host interaction, cell-mediated immune response and chemotherap, Bull. Math. Biol., 76(2014), 2884–2906.
    [49] K. Liao, X. Bai and A. Friedman, The role of CD200–CD200R in tumor immune evasion, J. Theor. Biol., 328(2013), 65–76.
    [50] M. C. Martins, A. M. A. Rocha, M. F. P. Costa, et al., Comparing immune-tumor growth models with drug therapy using optimal control, AIP Conf. Proc., 1738(2016), 300005.
    [51] M. Fernandez, M. Zhou and L. Soto-Ortiz, A computational assessment of the robustness of cancer treatments with respect to immune response strength, tumor size and resistance, Int. J. Tumor Ther., 7(2018), 1–26.
    [52] D. F. Tough and J. Sprent, Life span of naive and memory T cells, Stem Cells, 13(1995), 242–249.
    [53] C. M. Rollings, L. V. Sinclair, H. J. M. Brady, et al., Interleukin-2 shapes the cytotoxic T cell proteome and immune environment–sensing programs, Sci. Signal., 11(2018), eaap8112.
    [54] E. M. Janssen, E. E. Lemmens, T. Wolfe, et al., CD4+ T cells are required for secondary expansion and memory in CD8+ T lymphocytes, Nature, 421(2003), 852.
    [55] I. Gruber, N. Landenberger, A. Staebler, et al., Relationship between circulating tumor cells and peripheral T-cells in patients with primary breast cancer, Anticancer Res., 33(2013), 2233–2238.
    [56] D. Homann, L. Teyton and M. B. Oldstone, Differential regulation of antiviral T-cell immunity results in stable CD8+ but declining CD4+ T-cell memory, Nat. Med., 7(2001), 913–919.
    [57] R. J. De Boer, D. Homann and A. S. Perelson, Different dynamics of CD4+ and CD8+ T cell responses during and after acute lymphocytic choriomeningitis virus infection, J. Immunol., 171(2003), 3928–3935.
    [58] G. T. Skalski and J. F. Gilliam, Functional responses with predator interference: viable alternatives to the Holling type II model, Ecology, 82(2001), 3083–3092.
    [59] H. Nawata, M. T. Chong, D. Bronzert, et al., Estradiol-independent growth of a subline of MCF-7 human breast cancer cells in culture, J. Biol. Chem., 256(1981), 6895–6902.
    [60] R. Clarke, N. Brünner, B. S. Katzenellenbogen, et al., Progression of human breast cancer cells from hormone-dependent to hormone-independent growth both in vitro and in vivo, Proc. Natl. Acad. Sci. USA, 86(1989), 3649–3653.
    [61] N. T. Telang, G. Li, M. Katdare, et al., The nutritional herb Epimedium grandiflorum inhibits the growth in a model for the Luminal A molecular subtype of breast cancer, Oncol. Lett., 13 (2017), 2477–2482.
    [62] T. A. Caragine, M. Imai, A. B. Frey, et al., Expression of rat complement control protein Crry on tumor cells inhibits rat natural killer cell–mediated cytotoxicity, Blood, 100 (2002), 3304–3310.
    [63] M. R. Müller, F. Grünebach, A. Nencioni, et al., Transfection of dendritic cells with RNA induces CD4-and CD8-mediated T cell immunity against breast carcinomas and reveals the immunodominance of presented T cell epitopes, J. Immunol., 170 (2003), 5892–5896.
    [64] J. Chen, E. Hui, T. Ip, et al., Dietary flaxseed enhances the inhibitory effect of tamoxifen on the growth of estrogen-dependent human breast cancer (mcf-7) in nude mice, Clin. Cancer Res., 10(2004), 7703–7711.
    [65] P. V. Sivakumar, R. Garcia, K. S. Waggie, et al., Comparison of vascular leak syndrome in mice treated with IL21 or IL2, Comparative Med., 63 (2013), 13–21.
    [66] C.Wu, T.Motosha, H.A.Abdel-Rahman, etal., Freeandprotein-boundplasmaestradiol-17during the menstrual cycle, J. Clin. Endocrinol. Metab., 43(1976), 436–445.
    [67] E. Nikolopoulou, L. R. Johnson, D. Harris, et al., Tumour-immune dynamics with an immune checkpoint inhibitor, Lett. Biomath., 5(2018), S137–S159.
    [68] P. Vacca, E. Munari, N. Tumino, et al., Human natural killer cells and other innate lymphoid cells in cancer: friends or foes? Immunol. Lett., 201(2018), 14–19.
    [69] A. Cerwenka, J. Kopitz, P. Schirmacher, et al., HMGB1: the metabolic weapon in the arsenal of NK cells, Mol. Cell. Oncol., 3(2016), e1175538.
    [70] I. J. Fidler, Metastasis: quantitative analysis of distribution and fate of tumor emboli labeled with 125i-5-iodo-2'-deoxyuridine, J. Natl. Cancer Inst., 4(1970), 773–782.
    [71] G. G. Page and S. Ben-Eliyahu, A role for NK cells in greater susceptibility of young rats to metastatic formation, Dev. Comp. Immunol., 23(1999), 87–96.
    [72] O. E. Franco, A. K. Shaw, D. W. Strand, et al., Cancer associated fibroblasts in cancer pathogenesis, Semin. Cell Dev. Bio., 21(2010), 33–39.
    [73] G. P. Dunn, A. T. Bruce, H. Ikeda, et al., Cancer immunoediting: from immunosurveillance to tumor escape, Nat. Immunol., 3(2002), 991.
    [74] D. Mittal, M. M. Gubin, R. D. Schreiber, et al., New insights into cancer immunoediting and its three component phases-elimination, equilibrium and escape, Curr. Opin. Immunol., 27(2014), 16–25.
    [75] J. Nowak, P. Juszczynski and K. Warzocha, The role of major histocompatibility complex polymorphisms in the incidence and outcome of non-Hodgkin lymphoma, Curr. Immunol. Rev., 5(2009), 300–310.
    [76] J. G. B. Alvarez, M. González-Cao, N. Karachaliou, et al., Advances in immunotherapy for treatment of lung cancer, Cancer Biol. Med., 12(2015), 209–222.
    [77] M. E. Dudley and S. A. Rosenberg, Adoptive-cell-transfer therapy for the treatment of patients with cancer, Nat. Rev. Cancer, 3(2003), 666–675.
    [78] M. Su, C. Huang and A. Dai, Immune checkpoint inhibitors: therapeutic tools for breast cancer, Asian Pac. J. Cancer Prev., 17 (2016), 905–910.
    [79] M. Ebbo, L. Gérard, S. Carpentier, et al., Low circulating natural killer cell counts are associated with severe disease in patients with common variable immunodeficiency, EBioMedicine., 6(2016), 222–230.
    [80] S. H. Jee, J. Y. Park, H. Kim, et al., White blood cell count and risk for all-cause, cardiovascular, and cancer mortality in a cohort of Koreans, Am. J. Epidemiol., 162 (2005), 1062–1069.
    [81] W. B. Kannel, K. Anderson and T. W. Wilson, White blood cell count and cardiovascular disease: insights from the Framingham Study, Jama, 267 (1992), 1253–1256.
    [82] K. L. Margolis, J. E. Manson, P. Greenland, et al., Leukocyte count as a predictor of cardiovascular events and mortality in postmenopausal women: the Women's Health Initiative Observational Study, Arch. Intern. Med., 165(2005), 500–508.
    [83] B. K. Duffy, H. S. Gurm, V. Rajagopal, et al., Usefulness of an elevated neutrophil to lymphocyte ratio in predicting long-term mortality after percutaneous coronary intervention, Am. J. Cardiol., 97 (2006), 993–996.
    [84] B. D. Horne, J. L. Anderson, J. M. John, et al., Which white blood cell subtypes predict increased cardiovascular risk? J. Am. Coll. Cardiol., 45(2005), 1638–1643.
    [85] R. N. O. Cobucci, H. Saconato, P. H. Lima, et al., Comparative incidence of cancer in HIV-AIDS patients and transplant recipients, Cancer Epidemiol., 36(2012), e69–e73.
    [86] C. Bodelon, M. M. Madeleine, L. F. Voigt, et al., Is the incidence of invasive vulvar cancer increasing in the United States? Cancer Causes Control, 20(2009), 1779–1782.
    [87] M. R. Shurin, Cancer as an immune-mediated disease, Immunotargets Ther., 1 (2012), 1–6.
    [88] J. S. Lawrence, Leukopenia: its mechanism and therapy, J. Chronic. Dis., 6(1957), 351–364.
    [89] P. Venigalla, B. Motwani, A. Nallari, et al., A patient on hydroxyurea for sickle cell disease who developed an opportunistic infection, Blood, 100(2002), 363–364.
    [90] M. Iwamuro, S. Tanaka, A. Bessho, et al., Two cases of primary small cell carcinoma of the stomach, Acta. Med. Okayama, 63(2009), 293–298.
    [91] A. O. O. Chan, I. O. L. Ng, C. M. Lam, et al., Cholestatic jaundice caused by sequential carbimazole and propylthiouracil treatment for thyrotoxicosis, Hong Kong Med. J., 9(2003), 377–380.
    [92] J. H. Goodchild and M. Glick, A different approach to medical risk assessment, Endod. Topics, 4(2003), 1–8.
    [93] S. E. Hankinson, Endogenous hormones and risk of breast cancer in postmenopausal women, Breast Dis., 24(2006), 3–15.
    [94] R. Kaaks, S. Rinaldi, T. J. Key, et al., Postmenopausal serum androgens, oestrogens and breast cancer risk: the European prospective investigation into cancer and nutrition, Endocr. Relat. Cancer, 12(2005), 1071–1082.
    [95] S. A. Missmer, A. H. Eliassen, R. L. Barbieri, et al., Endogenous estrogen, androgen, and progesterone concentrations and breast cancer risk among postmenopausal women, J. Natl. Cancer Inst., 96(2004), 1856–1865.
    [96] A. A. Arslan, R. E. Shore, Y. Afanasyeva, et al., Circulating estrogen metabolites and risk for breast cancer in premenopausal women, Cancer Epidemiol. Biomarkers Prev., 18(2009), 2273–2279.
    [97] S. B. Brown and S. E. Hankinson, Endogenous estrogens and the risk of breast, endometrial, and ovarian cancers, Steroids, 99(2015), 8–10.
    [98] L. C. Houghton, D. Ganmaa, P. S. Rosenberg, et al., Associations of breast cancer risk factors with premenopausal sex hormones in women with very low breast cancer risk, Int. J. Environ. Res. Public Health, 13(2016), 1066.
    [99] R. Kaaks, K. Tikk, D. Sookthai, et al., Premenopausal serum sex hormone levels in relation to breast cancer risk, overall and by hormone receptor status-results from the EPIC cohortk, Int. J. cancer, 134(2014), 1947–1957.
    [100] A. Diefenbach, E. R. Jensen, A. M. Jamieson, et al., Rae1 and H60 ligands of the NKG2D receptor stimulate tumour immunity, Nature, 413(2001), 165.
    [101] A. Iannello and D. H. Raulet, Cold Spring Harbor symposia on quantitative biology, 1st edition, Cold Spring Harbor Laboratory Press, New York, 2013.
    [102] M. B. Pampena and E. M. Levy, Natural killer cells as helper cells in dendritic cell cancer vaccines, Front. Immunol., 6 (2015), 1–8.
    [103] E. Vivier, S. Ugolini, D. Blaise, et al., Targeting natural killer cells and natural killer T cells in cancer, Nat. Rev. Immunol., 12(2012), 239–252.
    [104] G. Liu, X. Fan, Y. Cai, et al., Efficacy of dendritic cell-based immunotherapy produced from cord blood in vitro and in a humanized NSG mouse cancer model, Immunotherapy, 11(2019), 599–616.
    [105] M. Schnekenburger, M. Dicato and M. F. Diederich, Anticancer potential of naturally occurring immunoepigenetic modulators: A promising avenue? Cancer, 125(2019), 1612–1628.
    [106] X. Feng, L. Lu, K. Wang, et al., Low expression of CD80 predicts for poor prognosis in patients with gastric adenocarcinoma, Future Oncol., 15 (2019), 473–483.
    [107] X. Lai and A. Friedman, Combination therapy of cancer with cancer vaccine and immune checkpoint inhibitors: a mathematical model, PloS One, 12 (2017), e0178479.
  • This article has been cited by:

    1. Junpeng Zhang, Zhiyong Ma, Lidi Quan, 2024, Research on Path Planning for Dense Storage Systems Based on an Improved Orthogonal Jump Point Search Algorithm, 979-8-3503-7507-7, 417, 10.1109/MLISE62164.2024.10674348
  • Reader Comments
  • © 2019 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(9218) PDF downloads(1554) Cited by(25)

Figures and Tables

Figures(10)  /  Tables(1)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog