skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Optimal reblocking as a practical tool for neighborhood development

Abstract

Fast urbanization is a common feature of many developing human societies. In many cases, past and present, explosive population growth in cities outstrips the rate of provision of housing and urban services and leads to the formation of informal settlements or slums. Slums are extremely varied in terms of their histories, infrastructure, and rates of change, but they share certain common features: informal land use, lack of physical accesses, and nonexistent or poor quality urban services. Currently, about 1 billion people worldwide live in slums, a number that could triple by 2050 if no practical solutions are enacted to reverse this trend. Underlying most problems of slums is the issue of lack of physical accesses to places of work and residence. This prevents residents and businesses from having an address, obtaining basic services such as water and sanitation, and being helped in times of emergency. In this paper, we show how the physical layout of any neighborhood can be classified quantitatively in terms of its access topology in a way that is independent of its geometry. Topological indices capturing levels of access to structures within a city block can then be used to define a constrained optimization problem, whose solutionmore » generates an access network that makes each structure in the settlement accessible to services with minimal disruption and cost. We discuss the general applicability of these techniques to several informal settlements in developing cities and demonstrate various technical aspects of our solutions. In conclusion, we discuss how these techniques could be used on a large scale to speed up human development processes in cities throughout the world while respecting their local identity and history.« less

Authors:
 [1];  [2];  [1]
  1. Santa Fe Inst. (SFI), Santa Fe, NM (United States)
  2. Sam Houston State Univ., Huntsville, TX (United States)
Publication Date:
Research Org.:
Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
Sponsoring Org.:
USDOE Office of Science (SC)
OSTI Identifier:
1394373
Grant/Contract Number:
AC05-00OR22725
Resource Type:
Journal Article: Accepted Manuscript
Journal Name:
Environment and Planning B: Urban Analytics and City Science
Additional Journal Information:
Journal Name: Environment and Planning B: Urban Analytics and City Science; Journal ID: ISSN 2399-8083
Country of Publication:
United States
Language:
English
Subject:
54 ENVIRONMENTAL SCIENCES

Citation Formats

Brelsford, Christa, Martin, Taylor, and Bettencourt, Luís M. A.. Optimal reblocking as a practical tool for neighborhood development. United States: N. p., 2017. Web. doi:10.1177/2399808317712715.
Brelsford, Christa, Martin, Taylor, & Bettencourt, Luís M. A.. Optimal reblocking as a practical tool for neighborhood development. United States. doi:10.1177/2399808317712715.
Brelsford, Christa, Martin, Taylor, and Bettencourt, Luís M. A.. Mon . "Optimal reblocking as a practical tool for neighborhood development". United States. doi:10.1177/2399808317712715.
@article{osti_1394373,
title = {Optimal reblocking as a practical tool for neighborhood development},
author = {Brelsford, Christa and Martin, Taylor and Bettencourt, Luís M. A.},
abstractNote = {Fast urbanization is a common feature of many developing human societies. In many cases, past and present, explosive population growth in cities outstrips the rate of provision of housing and urban services and leads to the formation of informal settlements or slums. Slums are extremely varied in terms of their histories, infrastructure, and rates of change, but they share certain common features: informal land use, lack of physical accesses, and nonexistent or poor quality urban services. Currently, about 1 billion people worldwide live in slums, a number that could triple by 2050 if no practical solutions are enacted to reverse this trend. Underlying most problems of slums is the issue of lack of physical accesses to places of work and residence. This prevents residents and businesses from having an address, obtaining basic services such as water and sanitation, and being helped in times of emergency. In this paper, we show how the physical layout of any neighborhood can be classified quantitatively in terms of its access topology in a way that is independent of its geometry. Topological indices capturing levels of access to structures within a city block can then be used to define a constrained optimization problem, whose solution generates an access network that makes each structure in the settlement accessible to services with minimal disruption and cost. We discuss the general applicability of these techniques to several informal settlements in developing cities and demonstrate various technical aspects of our solutions. In conclusion, we discuss how these techniques could be used on a large scale to speed up human development processes in cities throughout the world while respecting their local identity and history.},
doi = {10.1177/2399808317712715},
journal = {Environment and Planning B: Urban Analytics and City Science},
number = ,
volume = ,
place = {United States},
year = {Mon Jun 12 00:00:00 EDT 2017},
month = {Mon Jun 12 00:00:00 EDT 2017}
}

Journal Article:
Free Publicly Available Full Text
This content will become publicly available on June 12, 2018
Publisher's Version of Record

Save / Share:
  • This paper presents VMMP (A virtual machine for multiprocessors), a software package which provides a coherent set of services for parallel application programs running on diverse MIMD multiprocessors, both shared memory and message passing. It is intended to simplify parallel program writing and to promote portable and efficient programming. VMMP ensures high portability of application programs by implementing the same services on all target multiprocessors. It may also serve as a common intermediate language between very high level language compilers and various multiprocessors. VMMP supports two programming models: a virtual tree machine and a cooperating set of processes. Shared objectsmore » memory provides a flexible communication mechanism in addition to parameters and message passing. The combination of VMMP services allows one to express many parallel algorithms naturally and easily.« less
  • We propose a decentralized optimal load control scheme that provides contingency reserve in the presence of sudden generation drop. The scheme takes advantage of flexibility of frequency responsive loads and neighborhood area communication to solve an optimal load control problem that balances load and generation while minimizing end-use disutility of participating in load control. Local frequency measurements enable individual loads to estimate the total mismatch between load and generation. Neighborhood area communication helps mitigate effects of inconsistencies in the local estimates due to frequency measurement noise. Case studies show that the proposed scheme can balance load with generation and restoremore » the frequency within seconds of time after a generation drop, even when the loads use a highly simplified power system model in their algorithms. We also investigate tradeoffs between the amount of communication and the performance of the proposed scheme through simulation-based experiments.« less
  • A near time-optimal inspection-task-sequence planning for two cooperative industrial robots is outlined. The objective of the task-sequence planning is not only to find a series of near time-optimal final configurations for two arms where the inspection operations are undertaken for segment motions, but also to find a near time-optimal task sequence of inspection points. A time-efficient, continuous joint-acceleration profile is proposed for a class of general industrial robots, and simplified by suitably choosing the time intervals of the profile for each segment motion between any two points to be inspected. The optimization problem to find near time-optimal final configurations ismore » solved using the nonlinear optimization method of sequential quadratic programming (SQP). The computation overhead arising with this approach is successfully dealt with. The task-sequence planning is formulated as a variation of the travelling salesman problem, and simulated annealing is used of find a near time-optimal route. The near time-optimal task-sequence planning and time-efficient trajectory planning are effectively integrated with the related computational problems addressed and solved. The proposed method is applied to an environment containing two RTX SCARA-type industrial robots with six joints. Computations have been carried out for moving points in a route, as compared with the same fixed points in a route where only one arm moves. The conclusion is that it is much more efficient if two robot arms work in a cooperative mode. A speed increase by a factor of close to 3 has been achieved through effective use of joint capabilities in the cooperative system. Experiments have also been conducted on the RTX system, yielding satisfactory results that are consistent with those obtained by simulation.« less