Research@Lincoln
    • Login
     
    View Item 
    •   Research@Lincoln Home
    • Faculty of Environment, Society and Design
    • Environment, Society and Design series collections
    • Applied Computing Research Report series
    • View Item
    •   Research@Lincoln Home
    • Faculty of Environment, Society and Design
    • Environment, Society and Design series collections
    • Applied Computing Research Report series
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Discrete lines and ant algorithms

    Geer, P.; McLaughlin, H. W.; Unsworth, Keith
    Abstract
    This is a report on work in progress. The focus is on the design of an algorithm used to construct discrete lines. It is intended that this is the first step in applying models of complex adaptive systems to more complex geometric constructs. We construct discrete lines using agents (virtual ants) The agents are given very few rules, and otherwise move freely. With this design we allow a particular line to emerge from the movement of the agents rather than model the line first and then display it.
    Keywords
    algorithm; geometric constructs; discrete line; swarm intelligence
    Fields of Research
    0803 Computer Software; 0806 Information Systems
    Date
    2001-03
    Type
    Report (Technical Report)
    Collections
    • Applied Computing Research Report series [65]
    Share this

    on Twitter on Facebook on LinkedIn on Reddit on Tumblr by Email

    Thumbnail
    View/Open
    ac_rr_2001_01.pdf
    Metadata
     Expand record
    This service is managed by Learning, Teaching and Library
    • Archive Policy
    • Copyright and Reuse
    • Deposit Guidelines and FAQ
    • Contact Us
     

     

    Browse

    All of Research@LincolnCommunities & CollectionsTitlesAuthorsKeywordsBy Issue DateThis CollectionTitlesAuthorsKeywordsBy Issue Date

    My Account

    LoginRegister

    Statistics

    View Usage Statistics
    This service is managed by Learning, Teaching and Library
    • Archive Policy
    • Copyright and Reuse
    • Deposit Guidelines and FAQ
    • Contact Us