Nanorobots-assisted Detection of Multifocal Cancer: A Multimodal Optimization Perspective
Shaolong Shi Yifan Chen Xin Yao























Draft paper for IEEE Transactions on Cybernetics
Shell et al.: Bare Demo of IEEEtran.cls for IEEE Journals


Nanorobots-assisted Detection of Multifocal Cancer: A Multimodal Optimization Perspective
    Shaolong Shi, Student Member, IEEE,
        Yifan Chen, Senior Member, IEEE,
        and Xin Yao, Fellow, IEEE
S. Shi is with the Harbin Institute of Technology, Harbin 150001, China,
and also with the Department of Electrical and Electronic Engineering,
Southern University of Science and Technology, Shenzhen 518055,
China (e-mail: shishaolong@hit.edu.cn).
Y. Chen is with the Faculty of Science and Engineering and the Faculty
of Computing and Mathematical Sciences, University of Waikato, Hamilton
3240, New Zealand, and also with the Department of Electrical and
Electronic Engineering, Southern University of Science and Technology,
Shenzhen 518055, China (e-mail: yifan.chen@waikato.ac.nz).
X. Yao is with the Department of Computer Science and Engineering,
Southern University of Science and Technology, Shenzhen 518055,
China, and also with the School of Computer Science, University of
Birmingham, Birmingham B15 2TT, U.K. (e-mail: yaox@sustc.edu.cn).
    December 30, 2023
=====================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================






We propose a new framework of computing-inspired multifocal cancer detection procedure (MCDP). Under the rubric of MCDP, the tumor foci to be detected are regarded as solutions of the objective function, the tissue region around the cancer areas represents the parameter space, and the nanorobots loaded with contrast medium molecules for cancer detection correspond to the optimization agents. The process that the nanorobots detect tumors by swimming in the high-risk tissue region can be regarded as the process that the agents search for the solutions of an objective function in the parameter space with some constraints. For multimodal optimization (MMO) aiming to locate multiple optimal solutions in a single simulation run, niche technology has been widely used. Specifically, the Niche Genetic Algorithm (NGA) has been shown to be particularly effective in solving MMO. It can be used to identify the global optima of multiple hump functions in a running, keep effectively the diversity of the population, and avoid premature of the genetic algorithm. Learning from the optimization procedure of NGA, we propose the NGA-inspired MCDP in order to locate the tumor targets efficiently while taking into account realistic in vivo propagation and controlling of nanorobots, which is different from the use scenario of the standard NGA. To improve the performance of the MCDP, we also modify the crossover operator of the original NGA from crossing within a population to crossing between two populations. Finally, we present comprehensive numerical examples to demonstrate the effectiveness of the NGA-inspired MCDP when the biological objective function is associated with the blood flow velocity profile caused by tumor-induced angiogenesis.




computing-inspired bio-detection, niche genetic algorithm, multimodal optimization, cancer detection, nanorobots, contrast-enhanced medical imaging.






§ INTRODUCTION




 §.§ Background

Cancer refers to the abnormal and uncontrolled cell growth due to an accumulation of specific genetic and epigenetic defects <cit.>. It has been a leading cause of death globally for many years <cit.>. As many cancers are diagnosed only after they have metastasized throughout the body, effective and accurate methods of early-stage cancer detection and clinical diagnosis are urgently needed <cit.>. Early detection of tissue malignancy can increase greatly the chances for successful treatment and it is particularly relevant for cancers of breast, cervix, mouth, larynx, colon and rectum, and skin. For example, the five-year survival rate is 90% if colorectal cancer is diagnosed while still localized (i.e., confined to the wall of the bowel) but reduces to only 68% for regional disease (i.e., disease with lymph node involvement) and only 10% if distant metastases are present <cit.>. The conventional imaging technology of cancer detection such as ultrasound, computed tomography, positron emission tomography, and magnetic resonance imaging (MRI) have limitations in terms of tumor grading and molecular characterization as they are not designed to image a small number of cancer cells. Therefore, the conventional imaging modalities are unpromising in early detection and localization of cancer <cit.>.Nanoparticles are organic or inorganic, metallic, magnetic or even polymeric particles with a diameter of less than 100 nm <cit.>. Nanoparticles exhibit several unique properties that can be applied to develop chemical and biological sensors possessing desirable features like enhanced sensitivity and lower detection limits<cit.>. They can cross barriers such as blood-brain barrier or gastrointestinal barrier, which is a major advantage for the detection and visualization of tumor cells at very early stages, ideally at the level of a single cell or multiple cells <cit.>. For example, Liu et al. developed a nanosensor that detected Carcinoembryonic Antigen as a model protein, which showed potential applications for early diagnosis of diseases <cit.>. Several studies have also been carried out on early detection of tumor cells via the attachment of proteins expressed in very high quantity on cancer cells <cit.>. These novel nanoscale platforms possess excellent physiochemical properties and offer prolonged circulation times and improved absorption rates. However, these nanoparticles are circulated systemically and thus exhibit poor targeting efficiency for precise localization of the lesion <cit.>. Enhancing the diagnostic efficacy of nanoparticles necessitates the use of guidance technologies, which demand effective controlling and tracking of nanoparticles. This, in turn, calls for the integration of sensing and actuation mechanisms at the nanoscale.Recent decades have witnessed an enormous progress in manipulation of nanorobots in the in vivo environment for externally controllable early cancer detection <cit.>. Due to their small size, however, individual nanorobots are limited in their operational ranges and sensing capabilities. Nanorobots must work together to cover large areas and perform complex functionalities, which can be achieved through swarm intelligence <cit.>. Furthermore, so far, very few groups have succeeded in developing a fully autonomous (i.e. without the need for an external power source for propulsion) nanorobot capable of effective thrust in practical applications. To overcome these constraints, bio-inspired, biocompatible, and biodegradable nanorobots such as flagellated magnetotactic bacteria (MTB) with nanometer-sized magnetosomes have been proposed <cit.>. A swarm of MTB can be guided and tracked by an external monitoring device such as a customized MRI system to deliver drug-containing nanoliposomes to the target areas, which can significantly improve the therapeutic index of various nanocarriers in tumor regions as demonstrated in <cit.>. However, to the best of our knowledge, there has not been any experimental work in the existing literature on applying nanorobots for effective early cancer detection. This may be due to the fact that the destination is known a priori in targeted drug delivery, which provides a clear direction for generating the guiding field. On the other hand, the knowledge of the location (or even presence) of tissue malignancy is not available in early cancer detection, which significantly increases the complexity of system design.
  Recently, we have proposed a novel framework of computing-inspired bio-detection, also called “Touchable Computing” (TouchComp) <cit.>, which attempts to shed some theoretical insight on nanorobots-assisted, “smart” tumor sensing. TouchComp extends the idea of swarm intelligence to externally controllable biosensing, and improves the detection efficiency compared to the random search strategy relying on systemic circulation without making use of any intelligence about the biological, chemical or physical phenomenon induced by cancer cells<cit.>. The central idea of TouchComp is summarized in Fig. 1. Consider the case of a multifocal cancer detection procedure (MCDP). The tumor foci are the regions-of-interest (ROIs) in a high-risk tissue region. The tumors trigger certain in vivo phenomena that can be detected by observing the properties of a swarm of nanorobots deployed due to the interaction between the nanorobots and the environment. TouchComp aims to coordinate the movement of all nanorobots through specific schemes of swarm intelligence in order to search for the ROIs effectively. 



 §.§ Main Contributions of the Current Work

Different from our previous work, which focuses on the detection of a single cancer<cit.>, we look into the multimodal bio-detection scenario (i.e., MCDP) in our present work. Multifocal tumors are not multiple tumors; they originate from a unique cellular clone and grow multifocally in a single organ (liver, kidney, thyroid, etc.)<cit.>. As shown in Fig. 1, the solutions are the tumor foci to be detected; the parameter space representing all possible solutions is the tissue region at a high risk of malignancy; the externally manoeuvrable agents are nanorobots such as MTB. The agents (i.e., nanorobots) locate all the optimal solutions (i.e., tumors) by moving through the parameter space (i.e., high-risk tissue) under the guidance of an exterior steering field (i.e., MRI).Different from the classical mathematical computing that uses ideal non-interacting agents, the landscape for the MCDP that corresponds to a biological, chemical or physical cost function induced by tumors may be altered by agents due to the natural computing feature of MCDP, where agents interact with the solution space (i.e., nanorobots undergo reactions in the in vivo environment). An external observer can then infer the landscape for cancer detection by monitoring the movement of agents, which is called “seeing-is-sensing” in <cit.>. Provided with this analogy, a wide variety of computational techniques can thus be applied to the design of optimal MCDP. 

 The genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection, which generates high-quality solutions to optimization and search problems by relying on bio-inspired operators such as mutation, crossover and selection <cit.>. Niching methods allow the GA to maintain a population of diverse individuals, which can be used in domains that require the maintenance of multiple solutions <cit.>. In this paper, the niche GA (NGA) is considered and introduced into the MCDP with the assumption that the landscape of the tissue region under surveillance is nonlinear and multimodal. Furthermore, we modify the crossover strategy of the standard NGA by dividing the initial population into two groups and implementing crossover between groups to improve the performance of tumor detection. This paper is organized as follows. In Section II, we establish the foundation of computing-inspired MCDP by transforming the problem into an optimization procedure. In particular, we employ externally controllable nanorobots moving in the blood vessels to indicate the blood flow velocity that cannot be imaged by conventional imaging techniques because of their low resolutions<cit.>.  A multiple hump function with three global minima is employed to represent the distribution of blood flow velocity in the presence of cancerous tissues as described in <cit.>. In Section III, we propose the NGA-inspired MCDP following the problem setting presented in Section II and modify the normal NGA from the algorithmic perspective. In Section IV, some numerical examples are provided to demonstrate the principles and effectiveness of the proposed framework. Finally, some conclusive remarks are drawn in Section V.



§ COMPUTING-INSPIRED MCDP

The framework of computing-inspired bio-detection builds upon the similarity between the evolutionary computational process and the nanorobots-assisted MCDP. An evolutionary system can be seen as a process that, given particular initial conditions, follows a trajectory over time through a complex evolutionary state space to develop problem solvers automatically <cit.>. The swarm of nanorobots can be seen as an evolutionary system with the aim to accomplish bio-detection in an efficient and robust manner. More specifically, an aggregation of nanorobots loaded with contrast medium molecules are injected into the high-risk tissue, which corresponds to the initialization step of the evolutionary system. The nanorobots swim in the in vivo environment following certain trajectories to search for the tumors and the process is monitored by an external macro-scale device.  To evaluate the chance of finding tumors by nanorobots at specific locations, the concept of  “fitness function” in mathematics and computer science is introduced. As the existing experimental results show that the velocity of blood flow in which nanorobots exist usually increases with the distance from a cancer as to be elaborated further in Section II-B, the “fitness” of a nanorobot is negatively correlated with the blood flow velocity it experiences. Subsequently, the nanorobots update their locations in the tissue region under surveillance according to their fitness values. When a tumor is detected by a nanorobot, the nanorobot will adhere to the tumor and appears to stop moving (i.e., its velocity observed by the external monitoring system reduces to zero). It is worth noting  that the reduction of blood flow velocity alone does not necessarily mean that there is a tumor; only a complete stop of a nanorobot indicates the presence and location of a tumor. Subsequently, the nanorobots-assisted MCDP can be formulated as a stylized representation of the general problem of agents-aided solution-searching in the parameter space<cit.>.



 §.§ Problem Formulation

Consider a general parameter space 𝒫 with the following agent-dependent landscape <cit.>:


    o(x⃗;A)   =o_ms(x⃗;A)+o_fit(x⃗;A)
       =o_in(x⃗)+o_ex(x⃗;A)+o_fit(x⃗;A),x⃗∈𝒫,

where o_ms(x⃗;A) is the externally measurable objective function at location x⃗ for agent A, o_in(x⃗) is the intrinsic objective function at x⃗ independent of the presence or absence of A, o_ex(x⃗;A) is the extrinsic disturbance to the landscape caused by the interaction between A and the parameter space 𝒫, and o_fit(x⃗;A) is the correction factor accounting for the  activeness of A, due to its degradation in 𝒫.


The computing-inspired model of MCDP can be expressed as follows: given a search space (i.e., high-risk tissue) 𝒫, the agents move through the search space to locate the targets (i.e., tumors). It is assumed that the tumor locations  remain unchanged regardless of any variation caused by agents to the landscape. Nanorobots can bind to tumor cell receptors when they detect the tumors and stop moving, indicating termination of the MCDP. Furthermore, we use the velocity of blood flow as the objective function to define the fitness of nanorobots. Subsequently, the MCDP can be seen as a procedure to search for the minimum values of the objective function:
 
    min_x⃗∈𝒫 o (x⃗;A)

In the MCDP, an optimization or niching method aims to locate all possible x⃗^∗∈𝒫 (i.e., identifying all the tumors), which result in the smallest possible objective values:

    o (x⃗^∗;A)≤ o(x⃗;A),∀x⃗∈𝒫.

The mapped o values in the immediate vicinity of an x⃗^∗ should be all equal or higher than o(x⃗^∗; A). The corresponding solution set is denoted as 𝒮.More specifically, N nanorobotic agents
 A_1, A_2, ⋯, A_N
 are injected into the capillary around the high-risk tissue as shown in Fig. 1. The agents are employed to search for the solution set 𝒮, with their initial locations x⃗_1(t_0), x⃗_2(t_0), ⋯,  x⃗_N(t_0) at the initial time t_0. The initial speed of A_n (n=1,2,...,N) is v_n(x⃗_n(t_0)), which is assumed to be equal to the blood flow velocity at x⃗_n(t_0), as blood has a low Reynolds coefficient and the inertia force of agents can be ignored compared to the viscosity force <cit.>. The location of agent A_n can be updated according to Eq. (4) as the capillary network of the healthy tissue is grid-like<cit.>:

 
    x⃗_n(t_k+1)   =x⃗_n(t_k)+d_n(t_k,t_k+1)u⃗_∠ϕ_F(x⃗_n(t_k))+ϕ_P(x⃗_n(t_k))
       =x⃗_n(t_k)+∑_l=1^L_n(t_k,t_k+1)v_n(x⃗_n(t_k))δ t_n,l (t_k,t_k+1)
         ×u⃗_∠ϕ_n,l(t_k,t_k+1).



As illustrated in Fig. 2, when A_n does not meet the target, it will move continuously from x⃗_n(t_k) at time t_k to x⃗_n(t_k+1) at time t_k+1 in one iteration. The path of the nanorobot is composed of some linear segments. The term d_n(t_k,t_k+1) in (4) is the displacement length of A_n from x⃗_n(t_k) to x⃗_n(t_k+1), L_n(t_k,t_k+1) is the number of piecewise-linear sections along the trajectory of A_n from x⃗_n(t_k) to x⃗_n(t_k+1) in the search space; the traveling time of the l ^th linear section is δ t_n,l (t_k,t_k+1) that satisfies ∑_l=1^L_n(t_k,t_k+1)δ t_n,l(t_k,t_k+1)=t_k+1-t_k= t, where t is the iteration period  of the external steering field; u⃗_∠ϕ is a unit vector with angle ϕ. The objective functions obtained by all agents are computed according to (1). When A_n meets the solution set 𝒮 (i.e., a tumor is detected by a nanorobot), the stopping criteria are met. Otherwise, A_n will continue to move according to (4). A new agent will be randomly deployed within the injected area to ensure a constant number of agents in the medium, if an old agent  fully degenerates<cit.>.


 §.§ Landscape of Parameter Space

The blood flow rate in a vascular network is proportional to the pressure difference between the arterial and venous sides and inversely proportional to the viscous and geometric resistances. Microvascular pressures in the arterial side are nearly equal in tumor and nontumorous vessels. Pressures in venular vessels are significantly lower in a tumor than those in a nontumorous tissue <cit.>. The presence of tumors can thus affect the distribution of blood flow velocity in the capillaries of the high-risk tissue. The blood flow velocity was shown to decrease significantly when blood enters the tumors (dropping from 183.4± 35.0 μ m/s to 114.1± 26.1 μ m/s) and then soon return to the prior level upon flowing out of the tumors <cit.>. Furthermore, the blood flow near malignant tumors has been studied using radioactive  ^90Y microspheres while treating patients. The qualitative investigation demonstrates a normal tissue flow/tumor flow ratio in the range of 3/1 to 30/1. In addition, the peripheral tumor areas show a higher flow rate than more central portions <cit.>.Based on the aforementioned phenomena, we consider a representative artificial landscape to evaluate the performance of MCDP, which synthesizes the scenario of the blood flow variation around the tumor foci and can be regarded as the biological cost function to be optimized. In other words, the landscape shown in Fig. 3 can be used to represent f(x⃗)=o(x⃗;A)( mm/s), where x⃗=(x,y) is in mm and the parameter range is 0≤ x,y ≤ 10  mm.As shown in Fig. 3, the landscape with three different humps represents the situation that there are three tumor foci. The blood flow velocity  decreases with the distance from the centers of the three tumors, (5.1, 7.3), (4.4, 5.9) and (5, 2.8) respectively. The objective function is expressed as follows<cit.>.

    f(x⃗)={[ 0,              √((x-5.1)^2+(y-7.3)^2)≤ 0.1√(3); 0,              √((x-4.4)^2+(y-5.9)^2)≤ 0.1√(4); 0,                √((x-5)^2+(y-2.8)^2)≤ 0.1√(5);   -|f_1(x⃗)+f_2(x⃗)+f_3(x⃗)|+0.18,    Otherwise ].

where,

    f_1(x⃗)=(6-x)^2 exp[-(x-5)^2-(y-6)^2]


    f_2(x⃗)   =-0.1[x 5-(x-5)^3-(y-5)^5-1]^2 
         × exp[-(x-5)^2-(y-5)^2]


    f_3(x⃗)=0.5  exp[-(x-4)^2-(y-5)^2]






 §.§ Capillary Network Model of Tumors


In tumor vasculature, the large surface areas of capillaries make them the ideal site to provide nutrients and oxygen for the growing of tumors <cit.>. For tumors, angiogenesis appears to be a critical determinant of growth, invasion, and metastatic potential <cit.>. The angiogenic activity is located within a few hundred micrometers from the tumor rim. Fueling further growth, the resulting neovasculature is progressively coopted together with the original blood vessels by the expanding tumor mass while also pushing the neovascularization zone further into normal tissue <cit.>. The hastily formed new tumor microcirculation is always different from the host vasculature due to the influence of tumor angiogenesis factors and reduction of the available oxygen and nutrients <cit.>. Hence tumors are known to contain many tortuous vessels, shunts, vascular loops, widely variable intervascular distances, and large avascular areas, while normal capillaries are almost uniformly distributed to ensure adequate oxygen and nutrients transportation through the tissue <cit.>. The microvascular density is greater in the periphery of the highly vascularized tumor than that of the surrounding normal tissue <cit.>. These characteristics of tumor vasculature are well synthesized by the invasion percolation method, which is a classical statistical growth process governed by local substrate properties <cit.>.The simulation of vascular growth begins with a square lattice of discrete points that represents potential paths of vascular growth. Invasion percolation is implemented by first assigning uniformly distributed random values or strengths to each point on the underlying lattice. Starting at an arbitrary point the network occupies the lattice point adjacent to the current network that has the lowest strength. Growth is iterated until the desired lattice occupancy is reached. Blood vessels are assumed to connect all adjacent occupied lattice points. Blood is supplied at the starting point and withdrawn from the point nearest to the opposite corner. The network is then pruned to retain only those parts of the network with nonzero flow, leaving what is known as the “backbone” of the percolation cluster. Fig. 4 depicts the invasion percolation result after  260 growth steps, which also shows the backbone of the percolation clusters after pruning the vessels with zero blood flow.



It is a common strategy to restrict the vessels to run only parallel to the coordinate axes in modeling microvasculature <cit.>. Subsequently, it is appropriate to model the tumor capillary network using the latticed model with a fixed microvascular density for normal tissues and a greater microvascular density for the periphery of tumors. In this way, we simulate the tumor-induced angiogenesis for the blood flow velocity profile in (5) as shown in Fig. 5. The global capillary network is a square with an area of 10 mm× 10mm. There are three different tumor foci T1, T2, and T3, which are represented by three different square areas. The center coordinates of the tumors are (5.1, 7.3), (4.4, 5.9), (5, 2.8) and the side lengthes are 0.8mm, 1mm, 1.2mm, respectively. The centers of the tumor foci where the velocity of nanorobots becomes zero are three circular areas with a radius of 100 μ m. We define the intercapillary distances to be 100 μ m for the normal capillary network and 50μ m for capillaries in the periphery of the tumors. The periphery we define here corresponds to the blood velocity contour with the value of 60 μ m/s. The level of occupancy on the lattice is chosen to be 60% before pruning <cit.>. For each vascular element in Fig. 5, the flow rate is assumed to follow the Poiseuille's law. A number of capillary elements come together at each node, which satisfies mass conservation and therefore the sum of all flows at each node is zero. The general direction of blood flow is from the bottom left coordinate (0, 0) to the top right coordinate (10, 10), which is 45^∘ to the x and y axes, respectively as shown in Fig. 5. 





§ NGA-INSPIRED MCDP

The GA firstly proposed and analyzed by J. H. Holland in 1975 is commonly used to solve optimization problems<cit.>. As an effective method for solving complex problems, once the genetic representation and the fitness function are defined, a GA proceeds to initialize a population of solutions and then to improve it through repetitive application of the mutation, crossover, inversion and selection operators <cit.>.However, traditional GAs will push an artificial population towards convergence though natural evolutionary processes maintain a variety of species with each occupying a separate ecological niche. In nature, a niche is viewed as an organism's task in the environment, and a species is a collection of organisms with similar features. The subdivision of environment on the basis of an organism's role helps stable subpopulations to form around different niches in the environment <cit.>. Niching technique has recently been introduced into GAs to make it possible to find more than one local optimum of a multimodal landscape. Niching technology can make individuals evolve in a special environment by adjusting the fitness of individuals and the replacement strategy to generate the new generation. This method can maintain diversity of evolution population and acquire multiple solutions at the same time. Three general niching techniques: pre-selection, crowding, and fitness sharing are popular. The NGA is widely used in the multimodal and non-monotonic function optimization. In NGA, a niche is commonly referred to as the location of each optimum in the search space, and the fitness represents the resource of that niche. The organisms in a niche can be defined as similar individuals in terms of similarity metrics. The pseudo code of NGA is given in Algorithm 1.

 


As for the selection operator, we use the method of roulette wheel selection, which is the first selection method developed by Holland [44]. The probability of selection for each individual i, P_i, is defined by:
 
    P_i=F_i/∑_j=1^NF_j

where F_i is equal to the fitness of individual i. As for the crossover operator, we use traditional two-parent crossover operator and characterize the result of this process using real-value coding. The N individuals are paired at random, yielding N/2 couples. For each couple, crossover may or may not occur. Crossover does not occur with the probability of 1-p_c. Subsequently, both individuals proceed to the mutation stage. Otherwise, the couple generates two children via crossover, and only the children continue to the mutation stage.  The crossover and mutation processes are as follows:

    {[   x⃗_n^(k+1)=αx⃗_n^k+(1-α)x⃗_n+1^k; x⃗_n+1^(k+1)=αx⃗_n+1^k+(1-α)x⃗_n^k ].



    x⃗_n^(k+1)=x⃗_n^k+σ

where α follows a uniform distribution between 0 and 1 (i.e. α∼ U(0,1)), and σ follows a Gaussian distribution with mean 0 and variance 1 (i.e. σ∼ N(0,1)). Then, we use a niching method with modified crowding scheme to preserve population diversity. In crowding, each individual is compared to its neighbor within a constant distance, and the worse one is punished with a less opportunity to produce an offspring. Inspired by the physiological viewpoint that offspring resulting from inbreeding tends to be unhealthy, we further propose a modified NGA. In the algorithm, the initial population is separated into two groups with the same number of individuals randomly; each individual in one group can only perform crossover with an arbitrary individual in another group; the rest of the processes are similar with the original NGA. The modified NGA is represented in the pseudo code of Algorithm 2.


In the following, we will formulate the MCDP based on the similar evolutionary mechanism with the aforementioned NGAs but taking into account realistic in vivo propagation, controlling, and tracking scenarios.

Nanorobots loaded with contrast medium molecules are injected into the tissue region. The injection area is a 1  mm×1mm square as shown in Fig. 5. Each nanorobot adjusts its own location based on the comparison with its offspring location under the influence of the blood flow and the external magnetic field. Fig. 6 gives the movement direction of agent A_n in MCDP. The location of A_n at step k is denoted by the vector x⃗_n^k; the ideal child location of A_n following the NGA is denoted by the vector x⃗_n^(k+1) and the actual location of A_n following the MCDP is denoted by the vector x⃗_n^k+1 ; The blood velocity, the nanorobot's velocity subject to the magnetic field without the influence of blood flow, and their resultant velocity are denoted by v⃗_b, v⃗_m, and v⃗_c, respectively. Subsequently, agent A_n will move by one step in the direction of v⃗_c and the new position of A_n denoted by x⃗_n^k+1 will be obtained. x⃗_n^k+1 then plays the role of parent in the next generation. Following this process, each nanorobot updates its location step by step.  Note that the  capillary network of healthy tissue and the tumor capillary network used in the simulation procedure are discontinuous two-dimensional grids; therefore, all agents' locations are mapped to the locations associated with the nearest blood vessel.

Subsequently, agent A_n evolves according to the following equations:

    u⃗_∠ϕ (x⃗_n^k)=x⃗_n^(k+1)-x⃗_n^k/|x⃗_n^(k+1)-x⃗_n^k|



    x⃗_n^k+1=x⃗_n^k+∑_l=1^L_nv_nδ t_n,lu⃗_∠ϕ_n,l




The index n=1, 2, ⋯, N; ϕ(x⃗_n) denotes the angle generated by the co-force of the external magnetic field and the blood flow on agent A_n at x⃗_n^k, ϕ_n,l  is the direction of the l^ th linear section, u⃗_∠ϕ is a unit vector with angle ϕ, L_n is the number of piecewise-linear sections along the trajectory of the n^ th agent in one iteration and δ t_n,l is the traveling time of the l^ th linear section satisfying ∑_l=1^L_nδ t_n,l=Δ t with Δ t being the constant interval of the controlling cycle. Eq. (12) is used to calculate the new movement direction of the agent A_n by taking into the agent's current position and its offspring position obtained by the NGA operators. Eq. (13) is used to evaluate the updated position of the agent A_n given the steering field and the underlying vascular network.

From the description above, we can see that the ideal location of each new agent provides a direction for the movement of its parent nanorobot. Every parent nanorobot swims in the direction of its offspring agent under the steering of the external magnetic field and the blood flow field. The key difference between the NGA-inspired MCDP proposed here and the NGA presented previously is the offspring used. For NGA, the offsprings can be at any random locations in the continuous searching space, while the offsprings produced in the MCDP are all in the locations of blood vessels as the nanorobots can only swim in the capillary network. The NGA-inspired MCDP is described in Algorithm 3.


The initial deployment region of all the agents (i.e., the injected area shown in Fig. 5) is confined within a small area due to the practical constraint of the NGA-inspired MCDP, which is different from the normal NGA where all the agents are distributed in the whole searching space in the initial stage. All the nanorobots swim in the high-risk tissue under the external magnetic field to detect tumor areas using the MCDP given above. In case any nanorobot travels outside the search space, a new nanorobot will be deployed in the initial area to keep the number of nanorobots unchanged. The escaped nanorobot will degrade in the human body without causing any harmful effect <cit.>.

Inspired by the modified NGA, we introduce the new crossover scheme into MCDP. In this scenario, the nanorobots employed are divided into two groups randomly chosen in the initial phase with the other processes being similar to the aforementioned MCDP algorithm.



§ PERFORMANCE ANALYSIS

We use several numerical examples to elaborate on the NGA-inspired MCDP. The blood flow velocity profile presented in Section II-B and the vascular network model presented in Section II-C are applied to synthesize tumor angiogenesis. In the simulation, 12 nanorobots are employed to execute the MCDP. The small number of nanorobots is chosen to minimize any side effect resulting from an excessive amount of nanorobots on the human body. The initial injection area is 0≤ x, y ≤ 1  mm as shown in Fig. 5. The initial speed of nanorobots is assumed to be 210 μ m/s, which can be realized according to <cit.>. The period of iteration is set to be 4  s and the number of iterations is 60. The probabilities of crossover and mutation are 0.9 and 0.1, respectively. The crowding distance is set to be 0.15  mm.

Fig. 7 shows a typical curve of minimum outcomes obtained from the agents over multiple iterations for the blood velocity profile in (5) by using the NGA-inspired MCDP. It can be seen that an agent with the best performance can detect a tumor successfully at the 22^ th iteration. To compare with the cancer detection method relying on systemic circulation without applying any metaheuristics under the same physical scenario, we also present the result obtained from the random searching strategy, which means the nanorobots swim in the capillary network without any external influence except the blood flow. In this case, we can see that the best agent can detect a tumor after 41 iterations, which is slower compared to the NGA-inspired MCDP. Furthermore, for comparison from the algorithmic perspective, we show the result for the standard NGA without any physical constraints. In this case, a target can be detected after 4 iterations.


Fig. 8 shows the final locations of agents after 60 iterations by using the three different algorithms. We can see that the agents in the NGA and MCDP algorithms have a good performance of clustering with nearly all the agents swarming around the different target areas. On the contrary, the agents in the random searching strategy are scattered in the searching space without any swarming behavior.



To provide statistical analysis of robustness and precision of the NGA-inspired MCDP, we have carried out 500 independent simulation runs. Fig. 9(a), (b), and (c) show the histograms of the quantity of agents located at the targets using the MCDP, random searching and normal NGA strategies with the means of 1.54, 0.07 and 3.85, and the variances of 1.68, 0.08 and 1.79, respectively. It is evident that the proposed MCDP significantly outperforms random searching in term of the number of agents that can detect the cancer foci successfully. The performance of the MCDP strategy is not as good as the standard NGA, which is due to the fact that the MCDP is subject to various physical constraints.


Fig. 10 shows the curves of minimum outcomes obtained from the agents over multiple iterations by using the modified NGA, random searching and MCDP algorithms. Comparing Fig. 10 to Fig. 7, it can be seen that the MCDP inspired by the modified NGA performs worse than the one derived from the standard NGA in terms of the time spent in detecting a single tumor because of the decrease in exploitation for the modified NGA. On the other hand, the other comparison results between the three methods are similar with the earlier observations.



Fig. 11 shows the final locations of agents after 60 iterations in the second case. It can be seen that the result in Fig. 11 is similar with that in Fig. 8.


Fig. 12 gives the histogram of the quantity of agents located at the tumor foci using the three algorithms in the second case. Though the observations made in Fig. 12 are somewhat similar with those from Fig. 9, it is interesting to note that the mean in the second case for MCDP is 2.40, which is greater than the value of 1.54 in Fig. 9(a) due to the increase in exploration for the modified NGA.





 Fig. 13 presents the histograms of the quantity of nanorobots located at the three different tumors using the two different MCDP strategies. Fig. 13(a), (b) and (c) show the distribution of nanorobots located at the tumor foci T1, T2, and T3 respectively by using the MCDP inspired by the standard NGA.  Fig. 13(d), (e), and (f) show the distribution of nanorobots located at tumor foci T1, T2, and T3 respectively by using the MCDP inspired by the modified NGA. It is evident that for both the two strategies, the numbers of nanorobots in T1, T2, and T3 are increasing, which is in line with the sizes of the tumors T1<T2<T3. For comparison, we also give the distribution of nanorobots located at the tumor areas T1, T2, and T3 respectively by using the random searching strategy, which is shown in Fig. 14. It is interesting to see that the numbers of nanorobots in T1, T2, and T3 are not adaptable to the tumors' area ratio. This is mainly caused by the relative orientations of the three tumors. For example, tumor T1 can be barely detected by any nanorobot under the random searching strategy because it is shadowed by tumor T2 without any line-of-sight to the injected area.


 In summary, we can draw the conclusion that the MCDP performs better than random searching. Furthermore, the MCDP  inspired by the modified NGA performs better than that inspired by the normal NGA.

 

§ CONCLUSION

 We have presented the nanorobots-assisted detection of multifocal cancer from a multimodal optimization perspective. Specifically, we have proposed the NGA-inspired MCDP by taking into account realistic in vivo conditions of nanorobots and characteristics of vascular network around the tumor areas. Based on this work, we have also developed a modified NGA, which can be used to improve the performance of MCDP. Numerical examples have demonstrated the effectiveness of the proposed methodology for the blood flow velocity profile induced by tumor angiogenesis.

 Future work may include improving the performance of the algorithm to accomplish the detection of all the cancer areas with many more nanorobots. It is also important to examine further the impact of nanorobot nonidealities, such as finite lifespan, imprecise steering, and inaccurate tracking.





IEEEtran


Shaolong Shi
Biography text here.



Yifan Chen
Biography text here.






Xin Yao
Biography text here.
















